Compressed \varSigma -Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
DOI10.1007/978-3-030-92068-5_18zbMATH Open1514.94145OpenAlexW4206828612MaRDI QIDQ6041296FDOQ6041296
Thomas Attema, Ronald Cramer, Matthieu Rambaud
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_18
Recommendations
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Vector commitments over rings and compressed \(\varSigma \)-protocols
- Structure-preserving signatures and commitments to group elements
- Structure-preserving signatures and commitments to group elements
- A compressed \(\varSigma \)-protocol theory for lattices
zero-knowledgepairingsthreshold signature schemesbilinear groupscompressed \(\varSigma \)-protocol theory
Cites Work
- How to share a secret
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Fuzzy Identity-Based Encryption
- Parallel coin-tossing and constant-round secure two-party computation
- Title not available (Why is that?)
- Pairings for cryptographers
- Structure-preserving signatures and commitments to group elements
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Robust Threshold DSS Signatures
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Practical threshold signatures
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations
- FROST: Flexible round-optimized Schnorr threshold signatures
- Distributed SSH key management with proactive RSA threshold signatures
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- A compressed \(\varSigma \)-protocol theory for lattices
- Tight state-restoration soundness in the algebraic group model
Cited In (10)
- Predicate aggregate signatures and applications
- Efficient proofs of knowledge for threshold relations
- Extendable threshold ring signatures with enhanced anonymity
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- Algebraic reductions of knowledge
- Succinct verification of compressed sigma protocols in the updatable SRS setting
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Vector commitments over rings and compressed \(\varSigma \)-protocols
This page was built for publication: Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041296)
