One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
From MaRDI portal
Publication:2948385
DOI10.1007/978-3-662-46803-6_9zbMath1371.94639OpenAlexW827005847MaRDI QIDQ2948385
Publication date: 30 September 2015
Published in: Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46803-6_9
Related Items (32)
DualRing: generic construction of ring signatures with efficient instantiations ⋮ Compact ring signatures from learning with errors ⋮ More efficient shuffle argument from unique factorization ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ One-time traceable ring signatures ⋮ Identity based linkable ring signature with logarithmic size ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ On tightly-secure (linkable) ring signatures ⋮ Blind key-generation attribute-based encryption for general predicates ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Ring signatures with user-controlled linkability ⋮ DualDory: logarithmic-verifier linkable ring signatures through preprocessing ⋮ How to verifiably encrypt many bits for an election? ⋮ Efficient proofs of knowledge for threshold relations ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Compact Ring Signature in the Standard Model for Blockchain ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Succinct Diophantine-satisfiability arguments ⋮ Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices ⋮ Tightly secure ring signatures in the standard model ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Stacked garbling for disjunctive zero-knowledge proofs
This page was built for publication: One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
