Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173)

scientific article; zbMATH DE number 7600991

Language	Label	Description	Also known as
English	Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More	scientific article; zbMATH DE number 7600991

Statements

instance of

scholarly article

0 references

title

Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

13 October 2022

0 references

zbMATH Keywords

super-polynomial modulus restriction

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-45374-9_22

0 references

cites work

Efficient Lattice (H)IBE in the Standard Model

0 references

Q4228459

0 references

Faster Bootstrapping with Polynomial Error

0 references

Learning with Rounding, Revisited

0 references

A Framework for Identity-Based Encryption with Almost Tight Security

0 references

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance

0 references

New and Improved Key-Homomorphic Pseudorandom Functions

0 references

Pseudorandom Functions and Lattices

0 references

The Exact Security of Digital Signatures-How to Sign with RSA and Rabin

0 references

(Hierarchical) Identity-Based Encryption from Affine Message Authentication

0 references

On the Hardness of Learning with Rounding over Small Modulus

0 references

Pseudorandom Functions: Three Decades Later

0 references

Q4783728

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Key Homomorphic PRFs and Their Applications

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption

0 references

All-but-many lossy trapdoor functions from lattices and applications

0 references

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

0 references

Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability

0 references

Classical hardness of learning with errors

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Lattice-based FHE as secure as PKE

0 references

Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I

0 references

Fully, (Almost) Tightly Secure IBE and Dual System Groups

0 references

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

0 references

Efficient Pseudorandom Functions via On-the-Fly Adaptation

0 references

Advances in cryptology -- CRYPTO 2014. 34th annual cryptology conference, Santa Barbara, CA, USA, August 17--21, 2014. Proceedings, Part I

0 references

Tightly CCA-Secure Encryption Without Pairings

0 references

Fully homomorphic encryption using ideal lattices

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

Extended Nested Dual System Groups, Revisited

0 references

Tightly Secure Signatures and Public-Key Encryption

0 references

Simple and more efficient PRFs with tight security from LWE and matrix-DDH

0 references

Efficient Cryptosystems from 2 k -th Power Residue Symbols

0 references

Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps

0 references

Q5310362

0 references

Advances in cryptology -- CRYPTO 2017. 37th annual international cryptology conference, Santa Barbara, CA, USA, August 20--24, 2017. Proceedings. Part II

0 references

All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE

0 references

Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

Advances in cryptology -- EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15--19, 2012. Proceedings

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Advances in cryptology -- CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19--23, 2012. Proceedings

0 references

Identity-Based Cryptosystems and Signature Schemes

0 references

Pseudorandomness

0 references

Efficient Identity-Based Encryption Without Random Oracles

0 references

Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques

0 references

Identifiers

zbMATH Open document ID

1501.94047

0 references

DOI

10.1007/978-3-030-45374-9_22

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5041173