Secure multiparty computation from threshold encryption based on class groups
From MaRDI portal
Publication:6186606
DOI10.1007/978-3-031-38557-5_20MaRDI QIDQ6186606
Ivan B. Damgård, Claudio Orlandi, Lennart Braun
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
- Secure distributed key generation for discrete-log based cryptosystems
- Overdrive: making SPDZ great again
- Verifiable delay functions
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Bandwidth-efficient threshold EC-DSA
- Can a public blockchain keep a secret?
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Two-party ECDSA from hash proof systems and efficient instantiations
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Multiparty Computation from Somewhat Homomorphic Encryption
- Semi-homomorphic Encryption and Multiparty Computation
- How to share a secret
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Simple verifiable delay functions
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Public Key Cryptography - PKC 2006
- Efficient verifiable delay functions
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- An algebraic framework for silent preprocessing with trustless setup and active security
