Succinct Malleable NIZKs and an Application to Compact Shuffles
暂无分享,去创建一个
Markulf Kohlweiss | Melissa Chase | Anna Lysyanskaya | Sarah Meiklejohn | S. Meiklejohn | Anna Lysyanskaya | Markulf Kohlweiss | Melissa Chase
[1] Manoj Prabhakaran,et al. Rerandomizable RCCA Encryption , 2007, CRYPTO.
[2] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[3] Georg Fuchsbauer,et al. Commuting Signatures and Verifiable Encryption , 2011, EUROCRYPT.
[4] Markulf Kohlweiss,et al. Malleable Proof Systems and Applications , 2012, EUROCRYPT.
[5] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[6] 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).
[7] Hovav Shacham,et al. Delegatable Anonymous Credentials , 2008, IACR Cryptology ePrint Archive.
[8] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[9] Helger Lipmaa,et al. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments , 2012, TCC.
[10] Nir Bitansky,et al. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again , 2012, ITCS '12.
[11] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[12] Hovav Shacham,et al. Randomizable Proofs and Delegatable Anonymous Credentials , 2009, CRYPTO.
[13] Jens Groth,et al. Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures , 2006, ASIACRYPT.
[14] Craig Gentry,et al. Separating succinct non-interactive arguments from all falsifiable assumptions , 2011, STOC '11.
[15] Rafail Ostrovsky,et al. Robust Non-interactive Zero Knowledge , 2001, CRYPTO.
[16] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[17] Nir Bitansky,et al. Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.
[18] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[19] Jens Groth,et al. A Non-interactive Shuffle with Pairing Based Verifiability , 2007, ASIACRYPT.
[20] Markulf Kohlweiss,et al. Verifiable Elections That Scale for Free , 2013, Public Key Cryptography.
[21] Yevgeniy Dodis,et al. Cryptography against Continuous Memory Attacks , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[22] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..
[23] Brent Waters,et al. Targeted malleability: homomorphic encryption for restricted computations , 2012, ITCS '12.
[24] S. Micali,et al. Noninteractive Zero-Knowledge , 1990, SIAM J. Comput..
[25] Manuel Blum,et al. Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..
[26] Mihir Bellare,et al. The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols , 2004, CRYPTO.
[27] Ivan Damgård,et al. Secure Two-Party Computation with Low Communication , 2012, IACR Cryptol. ePrint Arch..
[28] Jens Groth,et al. Short Pairing-Based Non-interactive Zero-Knowledge Arguments , 2010, ASIACRYPT.
[29] Manoj Prabhakaran,et al. Homomorphic Encryption with CCA Security , 2008, ICALP.
[30] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[31] Ivan Damgård,et al. Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks , 1991, CRYPTO.