×

Found 27 Documents (Results 1–27)

Hardness of bounded distance decoding on lattices in \(\ell_p\) norms. (English) Zbl 07561764

Saraf, Shubhangi (ed.), 35th computational complexity conference, CCC 2020, July 28–31, 2020, Saarbrücken, Germany, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 169, Article 36, 21 p. (2020).
MSC:  68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

He gives C-sieves on the CSIDH. (English) Zbl 1492.81043

Canteaut, Anne (ed.) et al., Advances in cryptology – EUROCRYPT 2020. 39th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, May 10–14, 2020. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 12106, 463-492 (2020).
PDFBibTeX XMLCite
Full Text: DOI

Outsourcing computation: the minimal refereed mechanism. (English) Zbl 1435.68100

Caragiannis, Ioannis (ed.) et al., Web and Internet economics. 15th international conference, WINE 2019, New York, NY, USA, December 10–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11920, 256-270 (2019).
MSC:  68Q09 68Q10 91B03
PDFBibTeX XMLCite
Full Text: DOI arXiv

Noninteractive zero knowledge for NP from (Plain) Learning With Errors. (English) Zbl 1456.94106

Boldyreva, Alexandra (ed.) et al., Advances in cryptology – CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18–22, 2019. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 11692, 89-114 (2019).
MSC:  94A60 68P25
PDFBibTeX XMLCite
Full Text: DOI

Pseudorandomness of ring-LWE for any ring and modulus. (English) Zbl 1370.94536

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 461-473 (2017).
MSC:  94A60 68Q12
PDFBibTeX XMLCite
Full Text: DOI

On adaptively secure multiparty computation with a short CRS. (English) Zbl 1400.94182

Zikas, Vassilis (ed.) et al., Security and cryptography for networks. 10th international conference, SCN 2016, Amalfi, Italy, August 31 – September 2, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-44617-2/pbk; 978-3-319-44618-9/ebook). Lecture Notes in Computer Science 9841, 129-146 (2016).
MSC:  94A62 68Q10
PDFBibTeX XMLCite
Full Text: DOI

Classical hardness of learning with errors. (English) Zbl 1293.68159

Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 575-584 (2013).
MSC:  68Q25 68Q17 94A60
PDFBibTeX XMLCite
Full Text: DOI arXiv

How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. (English) Zbl 1330.94036

Jacobson, Michael (ed.) et al., Applied cryptography and network security. 11th international conference, ACNS 2013, Banff, AB, Canada, June 25–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38979-5/pbk). Lecture Notes in Computer Science 7954, 218-236 (2013).
MSC:  94A60 94A62 68P25
PDFBibTeX XMLCite
Full Text: DOI

Hardness of SIS and LWE with small parameters. (English) Zbl 1310.94161

Canetti, Ran (ed.) et al., Advances in cryptology – CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-40040-7/pbk). Lecture Notes in Computer Science 8042, 21-39 (2013).
MSC:  94A60 68P25
PDFBibTeX XMLCite
Full Text: DOI

Pseudorandom functions and lattices. (English) Zbl 1297.68071

Pointcheval, David (ed.) et al., Advances in cryptology – EUROCRYPT 2012. 31st annual international conference on the theory and applications of cryptographic techniques, Cambridge, UK, April 15–19, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29010-7/pbk). Lecture Notes in Computer Science 7237, 719-737 (2012).
PDFBibTeX XMLCite
Full Text: DOI

Enumerative lattice algorithms in any norm via \(M\)-ellipsoid coverings. (English) Zbl 1292.68091

Ostrovsky, Rafail (ed.), Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science – FOCS 2011, Palm Springs, CA, USA, October 22–25. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4571-4; 978-1-4577-1843-4/ebook). 580-589 (2011).
PDFBibTeX XMLCite
Full Text: DOI arXiv

On ideal lattices and learning with errors over rings. (English) Zbl 1279.94099

Gilbert, Henri (ed.), Advances in cryptology – EUROCRYPT 2010. 29th annual international conference on the theory and applications of cryptographic techniques, French Riviera, May 30 – June 3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13189-9/pbk). Lecture Notes in Computer Science 6110, 1-23 (2010).
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

A framework for efficient and composable oblivious transfer. (English) Zbl 1183.94046

Wagner, David (ed.), Advances in cryptology – CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17–21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85173-8/pbk). Lecture Notes in Computer Science 5157, 554-571 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Noninteractive statistical zero-knowledge proofs for lattice problems. (English) Zbl 1183.94045

Wagner, David (ed.), Advances in cryptology – CRYPTO 2008. 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17–21, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85173-8/pbk). Lecture Notes in Computer Science 5157, 536-553 (2008).
MSC:  94A60 68Q10 94A62
PDFBibTeX XMLCite
Full Text: DOI

Trapdoors for hard lattices and new cryptographic constructions. (English) Zbl 1231.68124

STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17–20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 197-206 (2008).
MSC:  94A60 68P25
PDFBibTeX XMLCite
Full Text: DOI

Lossy trapdoor functions and their applications. (English) Zbl 1228.94027

STOC’08. Proceedings of the 40th annual ACM symposium on theory of computing 2008, Victoria, Canada, May 17–20, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-047-0). 187-196 (2008).
MSC:  94A60 68P25
PDFBibTeX XMLCite
Full Text: DOI

SWIFFT: a modest proposal for FFT hashing. (English) Zbl 1154.68403

Nyberg, Kaisa (ed.), Fast software encryption. 15th international workshop, FSE 2008, Lausanne, Switzerland, February 10–13, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-540-71038-7/pbk). Lecture Notes in Computer Science 5086, 54-72 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Lattices that admit logarithmic worst-case to average-case connection factors. (English) Zbl 1232.68069

STOC’07. Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, CA, USA, June 11–13, 2007. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-631-8). 478-487 (2007).
MSC:  68Q17 11H06
PDFBibTeX XMLCite

Lower bounds for collusion-secure fingerprinting. (English) Zbl 1092.68605

Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 472-479 (2003).
MSC:  68P25
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software