Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
From MaRDI portal
(Redirected from Publication:5041173)
Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more (scientific article; zbMATH DE number 7600991)
Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more (scientific article; zbMATH DE number 7600991)
Recommendations
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- Towards tightly secure lattice short signature and id-based encryption
- Almost tight multi-instance multi-ciphertext identity-based encryption on lattices
- More efficient lattice PRFs from keyed pseudorandom synthesizers
- On tightly secure primitives in the multi-instance setting
Cites work
- (Hierarchical) identity-based encryption from affine message authentication
- A Framework for Identity-Based Encryption with Almost Tight Security
- Advances in cryptology -- ASIACRYPT 2016. 22nd international conference on the theory and application of cryptology and information security, Hanoi, Vietnam, December 4-8, 2016. Proceedings. Part II
- Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings
- Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I
- Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I
- Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II
- Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- All-but-many lossy trapdoor functions from lattices and applications
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques
- Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
- Classical hardness of learning with errors
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Efficient pseudorandom functions via on-the-fly adaptation
- Extended Nested Dual System Groups, Revisited
- Faster Bootstrapping with Polynomial Error
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Introduction to modern cryptography.
- Key homomorphic PRFs and their applications
- Lattice-based FHE as secure as PKE
- Learning with rounding, revisited. New reduction, properties and applications
- New and improved key-homomorphic pseudorandom functions
- On lattices, learning with errors, random linear codes, and cryptography
- On the hardness of learning with rounding over small modulus
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
- Pseudorandom functions and lattices
- Pseudorandom functions: three decades later
- Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
- Pseudorandomness
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptosystems from the worst-case shortest vector problem
- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Tightly CCA-secure encryption without pairings
- Tightly Secure Signatures and Public-Key Encryption
- Towards tightly secure lattice short signature and id-based encryption
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(13)- Simple and more efficient PRFs with tight security from LWE and matrix-DDH
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts
- Pseudorandom functions in NC class from the standard LWE assumption
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography
- Linkable ring signature scheme with stronger security guarantees
- Towards tightly secure short linearly homomorphic signatures
- Identity-based encryption from LWE with more compact master public key
- Discrete Gaussians modulo sub-lattices: new leftover hash lemmas for discrete Gaussians
- Adaptively secure IBE from lattices with asymptotically better efficiency
- Fully selective opening secure IBE from LWE
- Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
- Revisiting adaptively secure IBE from lattices with smaller modulus: a conceptually simple framework with low overhead
This page was built for publication: Almost tight security in lattices with polynomial moduli -- PRF, IBE, all-but-many LTF, and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041173)
