Non-Committing Encryption with Quasi-Optimal Ciphertext-Rate Based on the DDH Problem
暂无分享,去创建一个
[1] Nico Döttling,et al. Identity-Based Encryption from the Diffie-Hellman Assumption , 2017, CRYPTO.
[2] Rafail Ostrovsky,et al. Adaptive Security with Quasi-Optimal Rate , 2016, TCC.
[3] Rafail Ostrovsky,et al. Adaptive Garbled RAM from Laconic Oblivious Transfer , 2018, IACR Cryptol. ePrint Arch..
[4] Toshiaki Tanaka,et al. On the Existence of 3-Round Zero-Knowledge Protocols , 1998, CRYPTO.
[5] Sanjam Garg,et al. Trapdoor Functions from the Computational Diffie-Hellman Assumption , 2018, IACR Cryptol. ePrint Arch..
[6] Rafail Ostrovsky,et al. Trapdoor Hash Functions and Their Applications , 2019, IACR Cryptol. ePrint Arch..
[7] Tal Malkin,et al. Improved Non-committing Encryption with Applications to Adaptively Secure Protocols , 2009, ASIACRYPT.
[8] Sanjam Garg,et al. Adaptively Secure Garbling with Near Optimal Online Complexity , 2018, IACR Cryptol. ePrint Arch..
[9] Nico Döttling,et al. Laconic Oblivious Transfer and Its Applications , 2017, CRYPTO.
[10] Nico Döttling,et al. From Selective IBE to Full IBE and Selective HIBE , 2017, TCC.
[11] Vinod Vaikuntanathan,et al. Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions , 2018, IACR Cryptol. ePrint Arch..
[12] Sanjam Garg,et al. New Techniques for Efficient Trapdoor Functions and Applications , 2019, IACR Cryptol. ePrint Arch..
[13] Donald Beaver,et al. Plug and Play Encryption , 1997, CRYPTO.
[14] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[15] Ivan Damgård,et al. Improved Non-committing Encryption Schemes Based on a General Complexity Assumption , 2000, Annual International Cryptology Conference.
[16] Ran Canetti,et al. Optimal-Rate Non-Committing Encryption , 2017, ASIACRYPT.
[17] Sanjam Garg,et al. Two-round Multiparty Secure Computation from Minimal Assumptions , 2018, IACR Cryptol. ePrint Arch..
[18] Nico Döttling,et al. New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes , 2018, Public Key Cryptography.
[19] Mihir Bellare,et al. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.
[20] T. Tao,et al. On the singularity probability of random Bernoulli matrices , 2005, math/0501313.
[21] Rafail Ostrovsky,et al. Non-committing Encryption from Φ-hiding , 2015, TCC.