Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
From MaRDI portal
Publication:2829958
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
- scientific article; zbMATH DE number 1722673 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1088250 (Why is no real title available?)
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Advances in Cryptology – CRYPTO 2004
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient Two-Party Secure Computation on Committed Inputs
- Efficient concurrent zero-knowledge in the auxiliary string model
- Garbled circuits checking garbled circuits: more efficient and secure two-party computation
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
- Improved Garbled Circuit: Free XOR Gates and Applications
- P-signatures and Noninteractive Anonymous Credentials
- Privacy-free garbled circuits with applications to efficient zero-knowledge
- Private intersection of certified sets
- Publicly verifiable secret sharing
- Quadratic span programs and succinct NIZKs without PCPs
- Security proofs for signature schemes
- Short pairing-based non-interactive zero-knowledge arguments
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The knowledge complexity of interactive proof-systems
- Topics in Cryptology – CT-RSA 2005
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Two-output secure computation with malicious adversaries
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
- Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
- Oblivious issuance of proofs
- Somewhere statistically binding commitment schemes with applications
- Improved algebraic MACs and practical keyed-verification anonymous credentials
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
- 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)
