On the Role Definitions in and Beyond Cryptography
暂无分享,去创建一个
[1] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] Silvio Micali,et al. Physically Observable Cryptography (Extended Abstract) , 2004, TCC.
[3] Douglas R. Stinson,et al. Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.
[4] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[6] Victor Shoup,et al. On Formal Models for Secure Key Exchange , 1999, IACR Cryptol. ePrint Arch..
[7] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[8] Birgit Pfitzmann,et al. A Universally Composable Cryptographic Library , 2003, IACR Cryptol. ePrint Arch..
[9] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[10] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..
[12] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[13] Ivan Damgård,et al. Lectures on Data Security , 2003, Lecture Notes in Computer Science.
[14] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[15] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.
[16] Manuel Blum,et al. A Simple Unpredictable Pseudo-Random Number Generator , 1986, SIAM J. Comput..
[17] Neal Koblitz,et al. Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.
[18] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[19] Silvio Micali,et al. Physically Observable Cryptography (Extended Abstract) , 2004, Theory of Cryptography Conference.
[20] Mihir Bellare,et al. OCB: a block-cipher mode of operation for efficient authenticated encryption , 2001, CCS '01.
[21] Andrew Odlyzko,et al. Advances in Cryptology — CRYPTO’ 86 , 2000, Lecture Notes in Computer Science.
[22] Hugo Krawczyk,et al. Keying Hash Functions for Message Authentication , 1996, CRYPTO.
[23] Gerhard Goos,et al. Fast Software Encryption , 2001, Lecture Notes in Computer Science.
[24] Josh Benaloh,et al. Receipt-Free Secret-Ballot Elections , 1994, STOC 1994.
[25] Mihir Bellare,et al. Authenticated Key Exchange Secure against Dictionary Attacks , 2000, EUROCRYPT.
[26] Mihir Bellare,et al. Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography , 2000, ASIACRYPT.
[27] Bart Preneel,et al. Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .
[28] Danny Dolev,et al. On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[29] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[30] Donald Beaver,et al. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority , 2004, Journal of Cryptology.
[31] Mihir Bellare,et al. The Security of the Cipher Block Chaining Message Authentication Code , 2000, J. Comput. Syst. Sci..
[32] Mihir Bellare,et al. Entity Authentication and Key Distribution , 1993, CRYPTO.
[33] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[34] Ran Canetti,et al. The random oracle methodology, revisited , 2000, JACM.
[35] Jonathan Katz,et al. Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation , 2000, FSE.
[36] Birgit Pfitzmann,et al. Secure Asynchronous Reactive Systems , 2004 .
[37] Colin Boyd,et al. On Session Identifiers in Provably Secure Protocols: The Bellare-Rogaway Three-Party Key Distribution Protocol Revisited , 2004, SCN.
[38] Mihir Bellare,et al. Provably secure session key distribution: the three party case , 1995, STOC '95.
[39] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[40] Hugo Krawczyk,et al. Advances in Cryptology - CRYPTO '98 , 1998 .
[41] Tatsuaki Okamoto,et al. Advances in Cryptology — ASIACRYPT 2000 , 2000, Lecture Notes in Computer Science.
[42] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[43] Mihir Bellare,et al. Practice-Oriented Provable-Security , 1997, ISW.
[44] Birgit Pfitzmann,et al. A Universally Composable Cryptographic Library with Nested Operations , 2003 .
[45] David Wagner,et al. A Note on NSA's Dual Counter Mode of Encryption , 2001 .
[46] Mihir Bellare,et al. A concrete security treatment of symmetric encryption , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[47] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[48] David Chaum,et al. Minimum Disclosure Proofs of Knowledge , 1988, J. Comput. Syst. Sci..
[49] Josh Benaloh,et al. Receipt-free secret-ballot elections (extended abstract) , 1994, STOC '94.
[50] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[51] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[52] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[53] Manuel Blum,et al. Coin flipping by telephone a protocol for solving impossible problems , 1983, SIGA.