Composition with knowledge assumptions

DOI10.1007/978-3-030-84259-8_13MaRDI QIDQ2139641zbMATH OpenOpenAlexFDO

Authors Thomas Kerber, Aggelos Kiayias, 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)

Recommendations

• scientific article; zbMATH DE number 1304087
• scientific article; zbMATH DE number 1696658
• A framework for practical universally composable zero-knowledge protocols
• On succinct non-interactive arguments in relativized worlds
• On constant-round concurrent zero-knowledge from a knowledge assumption

Cites work

• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• Another look at extraction and randomization of Groth's zk-SNARK
• Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
• Constructive cryptography -- a new paradigm for security definitions and proofs
• Coupling of random systems
• Extractable Perfectly One-Way Functions
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Limits of extractability assumptions with distributional auxiliary input
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• Mining for privacy: how to bootstrap a snarky blockchain
• On the size of pairing-based non-interactive arguments
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• The algebraic group model and its applications
• Towards a Theory of Extractable Functions
• Updatable and universal common reference strings with applications to zk-SNARKs

Cited in

(8)

• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• The brave new world of global generic groups and UC-secure zero-overhead SNARKs
• Snarky ceremonies
• Triply adaptive UC NIZK
• Witness-succinct universally-composable SNARKs
• Algebraic adversaries in the universal composability framework
• Impossibilities in succinct arguments: black-box extraction and more
• Bitcoin as a Transaction Ledger: A Composable Treatment

Describes a project that uses

Uses Software

• Marlin
• GitHub
• libsnark
• Pinocchio

This page was built for publication: Composition with knowledge assumptions

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