×

Found 5 Documents (Results 1–5)

A lower bound for proving hardness of learning with rounding with polynomial modulus. (English) Zbl 07800252

Handschuh, Helena (ed.) et al., Advances in cryptology – CRYPTO 2023. 43rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023. Proceedings. Part V. Cham: Springer. Lect. Notes Comput. Sci. 14085, 805-835 (2023).
MSC:  94A60 68T07
PDFBibTeX XMLCite
Full Text: DOI

LWE-based FHE with better parameters. (English) Zbl 1398.68149

Tanaka, Keisuke (ed.) et al., Advances in information and computer security. 10th international workshop on security, IWSEC 2015, Nara, Japan, August 26–28, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-22424-4/pbk; 978-3-319-22425-1/ebook). Lecture Notes in Computer Science 9241, 175-192 (2015).
MSC:  68P25
PDFBibTeX XMLCite
Full Text: DOI

Public-key cryptosystems from the worst-case shortest vector problem (extended abstract). (English) Zbl 1304.94079

Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 333-342 (2009).
MSC:  94A60 68W25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

Main Field