Cryptography in the Multi-string Model
暂无分享,去创建一个
[1] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[2] Ivan Damgård,et al. Improved Non-committing Encryption Schemes Based on a General Complexity Assumption , 2000, CRYPTO.
[3] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[4] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[5] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Donald Beaver,et al. Server-assisted cryptography , 1998, NSPW '98.
[7] Juan A. Garay,et al. Strengthening Zero-Knowledge Protocols Using Signatures , 2003, EUROCRYPT.
[8] Joe Kilian,et al. An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions , 1998, Journal of Cryptology.
[9] Carl Pomerance,et al. On the Least Prime in Certain Arithmetic Progressions , 1990 .
[10] Ivan Damgård,et al. Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Proprocessing , 1992, EUROCRYPT.
[11] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[12] Ran Canetti,et al. Universally Composable Security with Global Setup , 2007, TCC.
[13] Ronald Cramer,et al. Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack , 2003, SIAM J. Comput..
[14] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[15] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[16] Yehuda Lindell,et al. Universally composable two-party and multi-party secure computation , 2002, STOC '02.
[17] Rafail Ostrovsky,et al. One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[18] Ivan Damgård,et al. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor , 2001, CRYPTO.
[19] Rafail Ostrovsky,et al. Non-interactive Zaps and New Techniques for NIZK , 2006, CRYPTO.
[20] A. D. Santis,et al. Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) , 1992, FOCS 1992.
[21] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.
[22] Moni Naor,et al. Synthesizers and Their Application to the Parallel Construction of Pseudo-Random Functions , 1999, J. Comput. Syst. Sci..
[23] Silvio Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[24] Rafail Ostrovsky,et al. One-way functions, hard on average problems, and statistical zero-knowledge proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[25] Amit Sahai,et al. Bringing People of Different Beliefs Together to Do UC , 2011, TCC.
[26] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[27] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[28] Ran Canetti,et al. Universally Composable Commitments , 2001, CRYPTO.
[29] Jens Groth,et al. Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures , 2006, ASIACRYPT.
[30] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[31] Salil P. Vadhan,et al. Derandomization in Cryptography , 2007, SIAM J. Comput..
[32] Rafael Pass,et al. On the Possibility of One-Message Weak Zero-Knowledge , 2004, TCC.
[33] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[34] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[35] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..
[36] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[37] Ke Yang,et al. On Simulation-Sound Trapdoor Commitments , 2004, EUROCRYPT.
[38] Osamu Watanabe. On One-Way Functions , 1989 .
[39] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[40] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[41] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[42] Giovanni Di Crescenzo,et al. Randomness-Optimal Characterization of Two NP Proof Systems , 2002, RANDOM.
[43] Rafail Ostrovsky,et al. Non-interactive and non-malleable commitment , 1998, STOC '98.
[44] Giovanni Di Crescenzo,et al. Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP , 1999, ICALP.
[45] Jonathan Katz,et al. Universally Composable Multi-party Computation with an Unreliable Common Reference String , 2008, TCC.
[46] Manuel Blum,et al. Non-interactive zero-knowledge and its applications , 1988, STOC '88.
[47] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[48] Rafail Ostrovsky,et al. Cryptography in the Multi-string Model , 2007, CRYPTO.
[49] V. Rich. Personal communication , 1989, Nature.
[50] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[51] Yehuda Lindell,et al. Secure Multi-Party Computation without Agreement , 2005, Journal of Cryptology.
[52] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[53] Rafail Ostrovsky,et al. New Techniques for Noninteractive Zero-Knowledge , 2012, JACM.
[54] Alfredo De Santis,et al. Zero-knowledge proofs of knowledge without interaction , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[55] Ran Canetti,et al. Universally composable protocols with relaxed set-up assumptions , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[56] Ran Canetti,et al. Universally Composable Commitments (Extended Abstract) , 2001, CRYPTO 2001.