Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
From MaRDI portal
Publication:2829958
DOI10.1007/978-3-662-53015-3_18zbMath1406.94037OpenAlexW2475985589MaRDI QIDQ2829958
Chaya Ganesh, Payman Mohassel, Melissa Chase
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_18
Related Items
Threshold Schnorr with stateless deterministic signing from standard assumptions ⋮ Somewhere statistically binding commitment schemes with applications ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ Succinct Diophantine-satisfiability arguments ⋮ Public-key generation with verifiable randomness ⋮ Hashing Garbled Circuits for Free
Cites Work
- Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation
- Publicly Verifiable Secret Sharing
- Security Proofs for Signature Schemes
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-Knowledge
- Two Halves Make a Whole
- Two-Output Secure Computation with Malicious Adversaries
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Improved Garbled Circuit: Free XOR Gates and Applications
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Private Intersection of Certified Sets
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The knowledge complexity of interactive proof-systems
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Quadratic Span Programs and Succinct NIZKs without PCPs
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Advances in Cryptology – CRYPTO 2004
- Efficient Two-Party Secure Computation on Committed Inputs
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Topics in Cryptology – CT-RSA 2005
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
