Approximate lower bound arguments

DOI10.1007/978-3-031-58737-5_3MaRDI QIDQ6637520

Pyrros Chaidos, Leonid Reyzin, Anatoliy Zinovyev, Aggelos Kiayias

Publication date: 13 November 2024

zbMATH Keywords

random oracleuniform random string models

Mathematics Subject Classification ID

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

Cites Work

• Universal classes of hash functions
• Security and composition of multiparty cryptographic protocols
• Interactive Oracle Proofs
• Advances in Cryptology - CRYPTO 2003
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Size of Pairing-Based Non-interactive Arguments
• Witness-succinct universally-composable SNARKs

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)