Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
From MaRDI portal
Publication:6041282
Recommendations
- Efficient identity-based encryption from LWR
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- RESILIENT LKH: SECURE MULTICAST KEY DISTRIBUTION SCHEMES
- Adaptively secure distributed PRFs from LWE
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- Distributed Public-Key Cryptography from Weak Secrets
- Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
- Efficient public key encryption based on ideal lattices (extended abstract)
- scientific article; zbMATH DE number 907956
- scientific article; zbMATH DE number 1186864
Cites work
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1024075 (Why is no real title available?)
- A modular analysis of the Fujisaki-Okamoto transformation
- Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
- Construction of Threshold (Hybrid) Encryption in the Random Oracle Model: How to Construct Secure Threshold Tag-KEM from Weakly Secure Threshold KEM
- Cryptography and Coding
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Faster secure multi-party computation of AES and DES using lookup tables
- How to record quantum queries, and applications to quantum indifferentiability
- Learning with rounding, revisited. New reduction, properties and applications
- Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
- On the hardness of learning with rounding over small modulus
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- Sashimi: cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol
- Secure integration of asymmetric and symmetric encryption schemes
- Secure integration of asymmetric and symmetric encryption schemes
- Secure two-party computation is practical
- Securing threshold cryptosystems against chosen ciphertext attack
- Securing threshold cryptosystems against chosen ciphertext attack
- Semi-homomorphic encryption and multiparty computation
- Sharing the LUOV: threshold post-quantum signatures
- Tag-KEM/DEM: A new framework for hybrid encryption
- Theory of Cryptography
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Threshold cryptosystems from threshold fully homomorphic encryption
- Threshold schemes from isogeny assumptions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(3)
This page was built for publication: Gladius: LWR Based Efficient Hybrid Public Key Encryption with Distributed Decryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041282)
