Approximate lower bound arguments

DOI10.1007/978-3-031-58737-5_3MaRDI QIDQ6637520zbMATH OpenFDO

Authors Pyrros Chaidos, Aggelos Kiayias, Leonid Reyzin, Anatoliy Zinovyev

Publication date 13 November 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58737-5_3

zbMATH Keywords

random oracleuniform random string models

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Universal Arguments and their Applications
• On the size of pairing-based non-interactive arguments
• Proving as fast as computing: succinct arguments with constant prover overhead
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• scientific article; zbMATH DE number 1031001

Cites work

• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Interactive oracle proofs
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the size of pairing-based non-interactive arguments
• Security and composition of multiparty cryptographic protocols
• Universal classes of hash functions
• Witness-succinct universally-composable SNARKs

Cited in

(1)

• Commit-and-prove system for vectors and applications to threshold signing

This page was built for publication: Approximate lower bound arguments

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