Lattice-based identity-based resplittable threshold public key encryption scheme
DOI10.1080/00207160.2014.928286zbMATH Open1376.94045OpenAlexW2003661250WikidataQ121120756 ScholiaQ121120756MaRDI QIDQ2804886FDOQ2804886
Authors: Kunwar Singh, C. Pandu Rangan, Arun K. Banerjee 
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
Recommendations
- More constructions of re-splittable threshold public key encryption
- Threshold Public-Key Encryption with Adaptive Security and Short Ciphertexts
- Provably secure threshold public-key encryption with adaptive security and short ciphertexts
- Efficient threshold encryption from lossy trapdoor functions
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
Randomized algorithms (68W20) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Fully homomorphic encryption using ideal lattices
- On lattices, learning with errors, random linear codes, and cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- How to share a secret
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient lattice (H)IBE in the standard model
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- Mathematics of public key cryptography.
- Better key sizes (and attacks) for LWE-based encryption
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- An efficient existentially unforgeable signature scheme and its applications
- Generic Construction of Chosen Ciphertext Secure Proxy Re-Encryption
- Title not available (Why is that?)
- Candidate Multilinear Maps from Ideal Lattices
- Lossy Trapdoor Functions and Their Applications
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
- Efficient threshold encryption from lossy trapdoor functions
Cited In (1)
This page was built for publication: Lattice-based identity-based resplittable threshold public key encryption scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804886)
