Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
暂无分享,去创建一个
Aggelos Kiayias | Hugo Krawczyk | Stanislaw Jarecki | A. Kiayias | H. Krawczyk | S. Jarecki | Stanislaw Jarecki
[1] Ralph C. Merkle,et al. A Digital Signature Based on a Conventional Encryption Function , 1987, CRYPTO.
[2] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[3] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[4] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[5] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? , 1998, CRYPTO.
[6] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[7] Silvio Micali,et al. Verifiable random functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[8] Burton S. Kaliski,et al. Server-assisted generation of a strong secret from a password , 2000, Proceedings IEEE 9th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 2000).
[9] Ronald Cramer,et al. Signature schemes based on the strong RSA assumption , 2000, TSEC.
[10] Mihir Bellare,et al. Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.
[11] David P. Jablon. Password Authentication Using Multiple Servers , 2001, CT-RSA.
[12] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] Rafail Ostrovsky,et al. Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords , 2001, EUROCRYPT.
[14] Jacques Stern,et al. Practical multi-candidate election system , 2001, PODC '01.
[15] Ivan Damgård,et al. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order , 2002, ASIACRYPT.
[16] Jan Camenisch,et al. Practical Verifiable Encryption and Decryption of Discrete Logarithms , 2003, CRYPTO.
[17] Chanathip Namprempre,et al. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.
[18] Rosario Gennaro,et al. Provably secure threshold password-authenticated key exchange , 2003, J. Comput. Syst. Sci..
[19] Ari Juels,et al. A New Two-Server Approach for Authentication with Short Secrets , 2003, USENIX Security Symposium.
[20] Moni Naor,et al. Number-theoretic constructions of efficient pseudo-random functions , 2004, JACM.
[21] Juan A. Garay,et al. Strengthening Zero-Knowledge Protocols Using Signatures , 2003, Journal of Cryptology.
[22] Benny Pinkas,et al. Keyword Search and Oblivious Pseudorandom Functions , 2005, TCC.
[23] Jonathan Katz,et al. Two-server password-only authenticated key exchange , 2005, J. Comput. Syst. Sci..
[24] Markus Jakobsson,et al. Threshold Password-Authenticated Key Exchange , 2002, Journal of Cryptology.
[25] Hugo Krawczyk,et al. HMQV: A High-Performance Secure Diffie-Hellman Protocol , 2005, CRYPTO.
[26] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[27] Marc Fischlin,et al. Round-Optimal Composable Blind Signatures in the Common Reference String Model , 2006, CRYPTO.
[28] Aggelos Kiayias,et al. Equivocal Blind Signatures and Adaptive UC-Security , 2008, TCC.
[29] Aggelos Kiayias,et al. On the Portability of Generalized Schnorr Proofs , 2009, EUROCRYPT.
[30] Xiaomin Liu,et al. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection , 2009, TCC.
[31] Xiaomin Liu,et al. Fast Secure Computation of Set Intersection , 2010, SCN.
[32] Nitesh Saxena,et al. Password-protected secret sharing , 2011, CCS '11.
[33] Jian Weng,et al. Zero-Knowledge Argument for Simultaneous Discrete Logarithms , 2011, Algorithmica.
[34] Masayuki Abe,et al. A framework for universally composable non-committing blind signatures , 2009, Int. J. Appl. Cryptogr..
[35] Jan Camenisch,et al. Practical yet universally composable two-server password-authenticated secret sharing , 2012, CCS.
[36] Jonathan Katz,et al. Round-Optimal Password-Based Authenticated Key Exchange , 2011, Journal of Cryptology.
[37] David Pointcheval,et al. New Techniques for SPHFs and Efficient One-Round PAKE Protocols , 2013, IACR Cryptol. ePrint Arch..
[38] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[39] Jan Camenisch,et al. Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment , 2014, CRYPTO.
[40] Yuval Ishai,et al. Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs , 2015, Journal of Cryptology.