A Framework for the Sound Specification of Cryptographic Tasks
暂无分享,去创建一个
[1] Leonid A. Levin,et al. Fair Computation of General Functions in Presence of Immoral Majority , 1990, CRYPTO.
[2] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[3] Aggelos Kiayias,et al. Sound and Fine-Grain Specification of Cryptographic Tasks , 2009 .
[4] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[5] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[6] Rafael Pass,et al. A unified framework for concurrent security: universal composability from stand-alone non-malleability , 2009, STOC '09.
[7] Mihir Bellare,et al. On Defining Proofs of Knowledge , 1992, CRYPTO.
[8] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[9] Silvio Micali,et al. Secure Computation (Abstract) , 1991, CRYPTO.
[10] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[11] Birgit Pfitzmann,et al. Low-Level Ideal Signatures and General Integrity Idealization , 2004, ISC.
[12] Donald Beaver,et al. Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority , 2004, Journal of Cryptology.
[13] Michael Backes,et al. How to Break and Repair a Universally Composable Signature Functionality , 2004, ISC.
[14] Ran Canetti,et al. Universally composable signature, certification, and authentication , 2004, Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004..
[15] Jürg Wullschleger. Oblivious-transfer amplification , 2007, Ausgezeichnete Informatikdissertationen.
[16] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[17] Ralf Küsters,et al. Simulation-based security with inexhaustible interactive Turing machines , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).
[18] Claude Crépeau,et al. Equivalence Between Two Flavours of Oblivious Transfers , 1987, CRYPTO.
[19] 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.
[20] John C. Mitchell,et al. Games and the Impossibility of Realizable Ideal Functionality , 2006, TCC.
[21] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[22] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[23] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[24] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[25] Amit Sahai,et al. New notions of security: achieving universal composability without trusted setup , 2004, STOC '04.