Simple, Fast, Efficient, and Tightly-Secure Non-malleable Non-interactive Timed Commitments

被引：0
|
作者：
Chvojka, Peter [1 ]
Jager, Tibor [2 ]
机构：
[1] IMDEA Software Institute, Madrid, Spain
[2] University of Wuppertal, Wuppertal, Germany
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2023年 / 13940 LNCS卷
关键词：
Compendex;
D O I：
26th IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2023
中图分类号：
学科分类号：
摘要：
Cryptography
引用
收藏
页码：500 / 529
相关论文
共 50 条
  • [1] Simple, Fast, Efficient, and Tightly-Secure Non-malleable Non-interactive Timed Commitments
    Chvojka, Peter
    Jager, Tibor
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2023, PT I, 2023, 13940 : 500 - 529
  • [2] Non-interactive Distributional Indistinguishability (NIDI) and Non-malleable Commitments
    Khurana, Dakshita
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT III, 2021, 12698 : 186 - 215
  • [3] Efficient and non-interactive non-malleable commitment
    Di Crescenzo, G
    Katz, J
    Ostrovsky, R
    Smith, A
    ADVANCES IN CRYPTOLOGY-EUROCRYPT 2001, PROCEEDINGS, 2001, 2045 : 40 - 59
  • [4] Black-Box Non-interactive Non-malleable Commitments
    Garg, Rachit
    Khurana, Dakshita
    Lu, George
    Waters, Brent
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT III, 2021, 12698 : 159 - 185
  • [5] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Pass, Rafael
    COMPUTATIONAL COMPLEXITY, 2016, 25 (03) : 607 - 666
  • [6] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Pass, Rafael
    THEORY OF CRYPTOGRAPHY (TCC 2013), 2013, 7785 : 334 - 354
  • [7] Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
    Rafael Pass
    computational complexity, 2016, 25 : 607 - 666
  • [8] Fast Non-Malleable Commitments
    Brenner, Hai
    Goyal, Vipul
    Richelson, Silas
    Rosen, Alon
    Vald, Margarita
    CCS'15: PROCEEDINGS OF THE 22ND ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2015, : 1048 - 1057
  • [9] Two-Round and Non-interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
    Lin, Huijia
    Pass, Rafael
    Soni, Pratik
    2017 IEEE 58TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2017, : 576 - 587
  • [10] Textbook Non-malleable Commitments
    Goyal, Vipul
    Pandey, Omkant
    Richelson, Silas
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 1128 - 1141
12345