Towards accountability in CRS generation
From MaRDI portal
Publication:2056795
DOI10.1007/978-3-030-77883-5_10zbMath1479.94112OpenAlexW3165889274MaRDI QIDQ2056795
Vipul Goyal, Hila Dahari, Gilad Asharov, Prabhanjan V. Ananth
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Definitions and properties of zero-knowledge proof systems
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A new approach to round-optimal secure multiparty computation
- Four round secure computation without setup
- Subversion-zero-knowledge SNARKs
- Promise zero knowledge and its applications to round optimal MPC
- Round optimal secure multiparty computation from minimal assumptions
- Fully homomorphic NIZK and NIWI proofs
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Bringing People of Different Beliefs Together to Do UC
- Universally composable two-party and multi-party secure computation
- A Framework for Efficient and Composable Oblivious Transfer
- Cryptography in the Multi-string Model
- Reducing Trust in the PKG in Identity Based Cryptosystems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Calling Out Cheaters: Covert Security with Public Verifiability
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Universally Composable Multi-party Computation with an Unreliable Common Reference String
- Two Round Multiparty Computation via Multi-key FHE
- Non-interactive Zaps and New Techniques for NIZK
- Round-optimal secure multi-party computation
This page was built for publication: Towards accountability in CRS generation
