One-out-of-many proofs: or how to leak a secret and spend a coin
From MaRDI portal
Publication:2948385
Recommendations
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- Efficient ring signatures in the standard model
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Short accountable ring signatures based on DDH
- Efficient Protocols for Set Membership and Range Proofs
Cited in
(44)- More efficient shuffle argument from unique factorization
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
- BLOOM: bimodal lattice one-out-of-many proofs and applications
- Ring signatures with user-controlled linkability
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Sigma protocols from verifiable secret sharing and their applications
- Efficient proofs of knowledge for threshold relations
- Compact ring signatures with post-quantum security in standard model
- SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
- An airdrop that preserves recipient privacy
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Efficient Protocols for Set Membership and Range Proofs
- DualDory: logarithmic-verifier linkable ring signatures through preprocessing
- Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Improved OR-composition of sigma-protocols
- Adding Linkability to Ring Signatures with One-Time Signatures
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- One-time traceable ring signatures
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys
- Tightly secure ring signatures in the standard model
- DualRing: generic construction of ring signatures with efficient instantiations
- Traceable ring signatures: general framework and post-quantum security
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- Stacked garbling for disjunctive zero-knowledge proofs
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Compact ring signatures from learning with errors
- Short code-based one-out-of-many proofs and applications
- On tightly-secure (linkable) ring signatures
- Identity based linkable ring signature with logarithmic size
- Secure Stern Signatures in Quantum Random Oracle Model
- CDS composition of multi-round protocols
- Compact proofs of partial knowledge for overlapping CNF formulae
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Compact Ring Signature in the Standard Model for Blockchain
- Succinct Diophantine-satisfiability arguments
- How to verifiably encrypt many bits for an election?
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Efficient Unique Ring Signature for Blockchain Privacy Protection
- Blind key-generation attribute-based encryption for general predicates
- scientific article; zbMATH DE number 1676637 (Why is no real title available?)
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
This page was built for publication: One-out-of-many proofs: or how to leak a secret and spend a coin
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948385)
