Compressed \varSigma -Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

DOI10.1007/978-3-030-92068-5_18MaRDI QIDQ6041296zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

zero-knowledgepairingsthreshold signature schemesbilinear groupscompressed \(\varSigma \)-protocol theory

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

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

Cites work

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1302863 (Why is no real title available?)
• scientific article; zbMATH DE number 1962164 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• A compressed \(\varSigma \)-protocol theory for lattices
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Distributed SSH key management with proactive RSA threshold signatures
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• FROST: Flexible round-optimized Schnorr threshold signatures
• Fuzzy Identity-Based Encryption
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• On the amortized complexity of zero knowledge protocols for multiplicative relations
• Pairings for cryptographers
• Parallel coin-tossing and constant-round secure two-party computation
• Practical threshold signatures
• Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography
• Robust threshold DSS signatures
• Structure-preserving signatures and commitments to group elements
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• 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)