Threshold linearly homomorphic encryption on Z/2ᵏZ
From MaRDI portal
Publication:6132407
Recommendations
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- scientific article; zbMATH DE number 1187298
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
- scientific article; zbMATH DE number 1559559
- scientific article; zbMATH DE number 1808209
- Functional encryption for quadratic functions from k-lin, revisited
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4171062 (Why is no real title available?)
- scientific article; zbMATH DE number 1303130 (Why is no real title available?)
- scientific article; zbMATH DE number 1942426 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- scientific article; zbMATH DE number 2086879 (Why is no real title available?)
- scientific article; zbMATH DE number 784878 (Why is no real title available?)
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- A key-exchange system based on imaginary quadratic fields
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- Bandwidth-efficient threshold EC-DSA
- Binary quadratic forms. An algorithmic approach
- Breaking the circuit size barrier for secure computation under DDH
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup
- Deterministic and Efficiently Searchable Encryption
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient verifiable delay functions
- Function secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing from Paillier encryption
- Improved efficiency of a linearly homomorphic cryptosystem
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Lossy trapdoor functions and their applications
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Monotone Circuits for the Majority Function
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Probabilistic encryption
- Promise $$\varSigma $$-Protocol: How to Construct Efficient Threshold ECDSA from Encryptions Based on Class Groups
- Public Key Cryptography - PKC 2006
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure distributed key generation for discrete-log based cryptosystems
- Short monotone formulae for the majority function
- Subvector commitments with application to succinct arguments
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Threshold Cryptosystems Based on Factoring
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- Two-party ECDSA from hash proof systems and efficient instantiations
- Worst-case complexity bounds for algorithms in the theory of integral quadratic forms
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
Cited in
(10)- Secure multiparty computation from threshold encryption based on class groups
- Provably secure threshold paillier encryption based on hyperplane geometry
- Threshold properties of prime power subgroups with application to secure integer comparisons
- Threshold cryptosystems from threshold fully homomorphic encryption
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- On sigma-protocols and (packed) black-box secret sharing schemes
- Constrained pseudorandom functions from homomorphic secret sharing
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- scientific article; zbMATH DE number 1187298 (Why is no real title available?)
- An improved threshold homomorphic cryptosystem based on class groups
This page was built for publication: Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132407)
