Composition with knowledge assumptions

DOI10.1007/978-3-030-84259-8_13zbMath1489.94101OpenAlexW3191505753MaRDI QIDQ2139641

Aggelos Kiayias, Thomas Kerber, Markulf Kohlweiss

Publication date: 18 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_13

zbMATH Keywords

secure protocolszero-knowledge succinct non-interactive arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Witness-succinct universally-composable SNARKs ⋮ Triply adaptive UC NIZK ⋮ Snarky ceremonies ⋮ Algebraic adversaries in the universal composability framework ⋮ Impossibilities in succinct arguments: black-box extraction and more

Uses Software

• Pinocchio
• GitHub
• libsnark
• Marlin

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Updatable and universal common reference strings with applications to zk-SNARKs
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• The algebraic group model and its applications
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Coupling of random systems
• Another look at extraction and randomization of Groth's zk-SNARK
• Mining for privacy: how to bootstrap a snarky blockchain
• Limits of Extractability Assumptions with Distributional Auxiliary Input
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
• Extractable Perfectly One-Way Functions
• Towards a Theory of Extractable Functions
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Composition with knowledge assumptions