Black-box anonymous commit-and-prove
From MaRDI portal
Recommendations
- Black-box non-interactive non-malleable commitments
- Round-optimal black-box commit-and-prove with succinct communication
- Bounds on the efficiency of black-box commitment schemes
- Black-box proof of knowledge of plaintext and multiparty computation with low communication overhead
- Black-box constructions of protocols for secure computation
- A flexibly revocable key-distribution scheme for efficient black-box tracing
- Black-box non-black-box zero knowledge
- Bounds on the efficiency of ``black-box commitment schemes
Cites work
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Dynamic accumulators and application to efficient revocation of anonymous credentials
- How to share a secret
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Non-interactive and information-theoretic secure verifiable secret sharing
- Probabilistically checkable proofs of proximity with zero-knowledge
- Round-optimal black-box commit-and-prove with succinct communication
- Round-optimal black-box two-party computation
- Universally composable commitments (extended abstract)
Cited in
(2)
This page was built for publication: Black-box anonymous commit-and-prove
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134847)