Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
From MaRDI portal
Recommendations
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Zero-knowledge interactive proof systems for new lattice problems
- scientific article; zbMATH DE number 1088230
- Threshold cryptosystems from threshold fully homomorphic encryption
- Cryptographic protocols from lattices (abstract)
- Lattice-based zero-knowledge arguments for integer relations
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- How to share a secret
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- On lattices, learning with errors, random linear codes, and cryptography
- Perfectly-Secure MPC with Linear Communication Complexity
- Public-key cryptosystems from the worst-case shortest vector problem
- Statistical secrecy and multibit commitments
- Theory of Cryptography
Cited in
(39)- Adaptively secure distributed PRFs from LWE
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Revocable attribute-based proxy re-encryption
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Actively secure setup for SPDZ
- Adaptively secure threshold symmetric-key encryption
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption
- Lattice-based identity-based resplittable threshold public key encryption scheme
- The geometry of lattice cryptography
- Efficient threshold encryption from lossy trapdoor functions
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Theory of Cryptography
- Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
- Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
- Verifiable decryption in the head
- Mixed-technique multi-party computations composed of two-party computations
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\)
- Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
- Provable security against decryption failure attacks from LWE
- An improved threshold homomorphic cryptosystem based on class groups
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Willow: secure aggregation with one-shot clients
- Revisiting the security of approximate FHE with noise-flooding countermeasures
- Efficient verifiable mixnets from lattices, revisited
- Low communication threshold fully homomorphic encryption
- Improved universal thresholdizer from iterative Shamir secret sharing
- Two-round threshold lattice-based signatures from threshold homomorphic encryption
- Correction to: ``Actively secure setup for SPDZ
- Pilvi: lattice threshold PKE with small decryption shares and improved security
- Low communication threshold FHE from standard (module-)LWE
- Simulation-secure threshold PKE from LWE with polynomial modulus
- More efficient lattice-based electronic voting from NTRU
- Efficient lattice-based polynomial evaluation and batch ZK arguments
This page was built for publication: Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408195)
