Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
From MaRDI portal
Publication:6132407
DOI10.1007/978-3-031-22966-4_4zbMath1519.94074OpenAlexW4320155073MaRDI QIDQ6132407
Fabien Laguillaumie, Guilhem Castagnos, Ida Tucker
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_4
Related Items (3)
Constrained pseudorandom functions from homomorphic secret sharing ⋮ I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups ⋮ Secure multiparty computation from threshold encryption based on class groups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Binary quadratic forms. An algorithmic approach
- Secure distributed key generation for discrete-log based cryptosystems
- Probabilistic encryption
- A key-exchange system based on imaginary quadratic fields
- Homomorphic secret sharing from Paillier encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- Transparent SNARKs from DARK compilers
- Bandwidth-efficient threshold EC-DSA
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Time- and space-efficient arguments from groups of unknown order
- Subvector commitments with application to succinct arguments
- Two-party ECDSA from hash proof systems and efficient instantiations
- Efficient pseudorandom correlation generators: silent OT extension and more
- Improved efficiency of a linearly homomorphic cryptosystem
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Function Secret Sharing
- Short monotone formulae for the majority function
- Lossy trapdoor functions and their applications
- Monotone Circuits for the Majority Function
- Deterministic and Efficiently Searchable Encryption
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Threshold Cryptosystems Based on Factoring
- Efficient Cryptosystems from 2 k -th Power Residue Symbols
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Public Key Cryptography - PKC 2006
- Efficient verifiable delay functions
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
This page was built for publication: Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
