Universally Composable Symmetric Encryption
暂无分享,去创建一个
[1] John C. Mitchell,et al. Inductive Proofs of Computational Secrecy , 2007, ESORICS.
[2] Véronique Cortier,et al. A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols , 2007, ESORICS.
[3] P. Cogn,et al. A Computationally Sound Mechanized Prover for Security Protocols , 2009 .
[4] Martín Abadi,et al. Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) , 2007, Journal of Cryptology.
[5] Mihir Bellare,et al. Provably secure session key distribution: the three party case , 1995, STOC '95.
[6] John C. Mitchell,et al. Games and the Impossibility of Realizable Ideal Functionality , 2006, TCC.
[7] Ralf Küsters,et al. Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation , 2008, 2008 21st IEEE Computer Security Foundations Symposium.
[8] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[9] Birgit Pfitzmann,et al. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[10] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[11] John Black,et al. Encryption-Scheme Security in the Presence of Key-Dependent Messages , 2002, Selected Areas in Cryptography.
[12] Hugo Krawczyk,et al. Universally Composable Notions of Key Exchange and Secure Channels , 2002, EUROCRYPT.
[13] Colin Boyd,et al. Protocols for Authentication and Key Establishment , 2003, Information Security and Cryptography.
[14] Ran Canetti,et al. Universally composable signature, certification, and authentication , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[15] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[16] Ran Canetti,et al. Universal Composition with Joint State , 2003, CRYPTO.
[17] Peeter Laud,et al. Symmetric encryption in automatic analyses for confidentiality against active adversaries , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.
[18] Ran Canetti,et al. Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols , 2006, TCC.
[19] Birgit Pfitzmann,et al. On the Cryptographic Key Secrecy of the Strengthened Yahalom Protocol , 2006, SEC.
[20] Ran Canetti,et al. Security and composition of cryptographic protocols: a tutorial (part I) , 2006, SIGA.
[21] Véronique Cortier,et al. Computational soundness of observational equivalence , 2008, CCS.
[22] Birgit Pfitzmann,et al. Key-dependent Message Security under Active Attacks--BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles , 2007, 20th IEEE Computer Security Foundations Symposium (CSF'07).
[23] Martín Abadi,et al. Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)* , 2000, Journal of Cryptology.
[24] Michael Backes,et al. How to Break and Repair a Universally Composable Signature Functionality , 2004, ISC.
[25] Ralf Küsters,et al. Simulation-based security with inexhaustible interactive Turing machines , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).
[26] Birgit Pfitzmann,et al. A model for asynchronous reactive systems and its application to secure message transmission , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.
[27] Chanathip Namprempre,et al. Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, Journal of Cryptology.
[28] Ralf Küsters,et al. Conditional reactive simulatability , 2006, International Journal of Information Security.
[29] John C. Mitchell,et al. Computationally sound compositional logic for key exchange protocols , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).
[30] Hugo Krawczyk,et al. A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract) , 1998, STOC '98.
[32] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[33] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[34] Roger M. Needham,et al. Authentication revisited , 1987, OPSR.