Lattice-based identity-based resplittable threshold public key encryption scheme
From MaRDI portal
Publication:2804886
DOI10.1080/00207160.2014.928286zbMath1376.94045WikidataQ121120756 ScholiaQ121120756MaRDI QIDQ2804886
No author found.
Publication date: 6 May 2016
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.928286
lattice; identity-based encryption; learning with error; resplittable threshold public key encryption
94A60: Cryptography
68W20: Randomized algorithms
94A62: Authentication, digital signatures and secret sharing
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient existentially unforgeable signature scheme and its applications
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Mathematics of Public Key Cryptography
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- How to share a secret
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Efficient Threshold Encryption from Lossy Trapdoor Functions
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Lossy Trapdoor Functions and Their Applications
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Candidate Multilinear Maps from Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
