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_18zbMATH Open1406.94037OpenAlexW2475985589MaRDI QIDQ2829958FDOQ2829958
Authors: Melissa Chase, Chaya Ganesh, Payman Mohassel 
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
Recommendations
- P-signatures and Noninteractive Anonymous Credentials
- Randomizable Proofs and Delegatable Anonymous Credentials
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Non-interactive zero-knowledge proofs for composite statements
- Advances in Cryptology – CRYPTO 2004
Cites Work
- Security proofs for signature schemes
- The exact security of digital signatures -- how to sign with RSA and Rabin
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Topics in Cryptology – CT-RSA 2005
- Efficient concurrent zero-knowledge in the auxiliary string model
- Improved Garbled Circuit: Free XOR Gates and Applications
- Private intersection of certified sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Efficient Two-Party Secure Computation on Committed Inputs
- Title not available (Why is that?)
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- Two-output secure computation with malicious adversaries
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Title not available (Why is that?)
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Short pairing-based non-interactive zero-knowledge arguments
- Publicly verifiable secret sharing
- Title not available (Why is that?)
- Quadratic span programs and succinct NIZKs without PCPs
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Privacy-free garbled circuits with applications to efficient zero-knowledge
Cited In (21)
- Randomizable Proofs and Delegatable Anonymous Credentials
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- Sigma protocols from verifiable secret sharing and their applications
- Efficient threshold zero-knowledge with applications to user-centric protocols
- Threshold Schnorr with stateless deterministic signing from standard assumptions
- Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
- Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System
- P-signatures and Noninteractive Anonymous Credentials
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- Hashing garbled circuits for free
- Oblivious issuance of proofs
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- Somewhere statistically binding commitment schemes with applications
- Improved algebraic MACs and practical keyed-verification anonymous credentials
- Succinct Diophantine-satisfiability arguments
- Public-key generation with verifiable randomness
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
This page was built for publication: Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829958)
