Towards accountability in CRS generation

DOI10.1007/978-3-030-77883-5_10MaRDI QIDQ2056795zbMATH OpenOpenAlexFDO

Authors Gilad Asharov, Hila Dahari, Vipul Goyal, Prabhanjan Ananth

Publication date 8 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-77883-5_10

zbMATH Keywords

trusted authoritynon-interactive zero knowledgetwo-round secure two-party computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• UC-secure CRS generation for SNARKs
• Updatable and universal common reference strings with applications to zk-SNARKs
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• scientific article; zbMATH DE number 6720551
• CRS-updatable asymmetric quasi-adaptive NIZK arguments

Cites work

• scientific article; zbMATH DE number 2009949 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• A new approach to round-optimal secure multiparty computation
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• Bringing people of different beliefs together to do UC
• Calling out cheaters: covert security with public verifiability
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Cryptography in the Multi-string Model
• Definitions and properties of zero-knowledge proof systems
• Four round secure computation without setup
• Fully homomorphic NIZK and NIWI proofs
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• Non-interactive Zaps and New Techniques for NIZK
• Promise zero knowledge and its applications to round optimal MPC
• Reducing Trust in the PKG in Identity Based Cryptosystems
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal secure multi-party computation
• Subversion-zero-knowledge SNARKs
• Two round multiparty computation via multi-key FHE
• Two-round multiparty secure computation from minimal assumptions
• Universally Composable Multi-party Computation with an Unreliable Common Reference String
• Universally composable two-party and multi-party secure computation
• Zaps and Their Applications
• \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

Cited in

(4)

• Privacy-preserving accountable computation
• Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
• Witness semantic security
• NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness

This page was built for publication: Towards accountability in CRS generation

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