Secure Computation Without Authentication
暂无分享,去创建一个
Yehuda Lindell | Ran Canetti | Tal Rabin | Rafael Pass | Boaz Barak | R. Pass | R. Canetti | B. Barak | Yehuda Lindell | T. Rabin
[1] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[2] A. Yao. How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[4] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[5] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[6] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[7] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[8] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.
[9] Hugo Krawczyk,et al. Public-key cryptography and password protocols , 1998, CCS '98.
[10] Victor Shoup,et al. On Formal Models for Secure Key Exchange , 1999, IACR Cryptol. ePrint Arch..
[11] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[12] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[13] Ran Canetti,et al. Maintaining Authenticated Communication in the Presence of Break-Ins , 2000, Journal of Cryptology.
[14] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[15] Ran Canetti,et al. Universally Composable Commitments (Extended Abstract) , 2001, CRYPTO 2001.
[16] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[17] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[18] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .
[19] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[20] Matthias Fitzi,et al. Detectable byzantine agreement secure against faulty majorities , 2002, PODC '02.
[21] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[22] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions , 2003, EUROCRYPT.
[23] Ran Canetti,et al. Universal Composition with Joint State , 2003, CRYPTO.
[24] Rafael Pass,et al. Bounded-concurrent secure two-party computation in a constant number of rounds , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[25] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[26] Ran Canetti,et al. Universally composable signature, certification, and authentication , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[27] Yehuda Lindell,et al. Lower Bounds for Concurrent Self Composition , 2004, TCC.
[28] Salil P. Vadhan,et al. Simpler Session-Key Generation from Short Random Passwords , 2004, TCC.
[29] Yehuda Lindell,et al. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions , 2003, Journal of Cryptology.
[30] Yehuda Lindell,et al. Universally Composable Password-Based Key Exchange , 2005, EUROCRYPT.
[31] Yehuda Lindell,et al. Session-Key Generation Using Human Passwords Only , 2001, Journal of Cryptology.
[32] Jan Camenisch,et al. Credential Authenticated Identification and Key Exchange , 2010, IACR Cryptol. ePrint Arch..