Improved straight-line extraction in the random oracle model with applications to signature aggregation

DOI10.1007/978-3-031-22966-4_10MaRDI QIDQ6132413zbMATH OpenOpenAlexFDO

Authors Yashvanth Kondi, Abhi Shelat

Publication date 16 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22966-4_10

zbMATH Keywords

Fischlin's techniquestrongly-sound Sigma protocols

Mathematics Subject Classification ID

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

Recommendations

• Adaptive proofs have straightline extractors (in the random oracle model)
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Signatures from sequential-OR proofs
• Improved OR-composition of sigma-protocols
• On the (in)security of SNARKs in the presence of oracles

Cites work

• scientific article; zbMATH DE number 4101089 (Why is no real title available?)
• scientific article; zbMATH DE number 708798 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Aurora: transparent succinct arguments for R1CS
• Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
• Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Efficient signature generation by smart cards
• High-speed high-security signatures
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Modern computer algebra
• Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures
• Non-interactive zero-knowledge proofs in the quantum random oracle model
• On the (in)security of Fischlin's paradigm
• Public Key Cryptography - PKC 2006
• Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
• Securing threshold cryptosystems against chosen ciphertext attack
• Security proofs for signature schemes
• Taming the many EdDSAs

Cited in

(16)

• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• zkSNARKs in the ROM with unconditional UC-security
• Practical blind signatures in pairing-free groups
• A generic construction of an anonymous reputation system and instantiations from lattices
• Efficient NIZK arguments with straight-line simulation and extraction
• Endemic oblivious transfer via random oracles, revisited
• Witness-succinct universally-composable SNARKs
• Adaptive UC NIZK for practical applications
• Straight-line knowledge extraction for multi-round protocols
• Multi-Holder anonymous credentials from BBS signatures
• Server-aided anonymous credentials
• Blind signatures from proofs of inequality
• Sometimes you can't distribute random-oracle-based proofs
• Secure multiparty computation with identifiable abort via vindicating release
• Universally composable -protocols in the global random-oracle model
• Sequential half-aggregation of lattice-based signatures

This page was built for publication: Improved straight-line extraction in the random oracle model with applications to signature aggregation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132413)