×

Found 5 Documents (Results 1–5)

Digital signatures based on the hardness of ideal lattice problems in all rings. (English) Zbl 1407.94141

Cheon, Jung Hee (ed.) et al., 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. Berlin: Springer. Lect. Notes Comput. Sci. 10032, 196-214 (2016).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Lattice signatures without trapdoors. (English) Zbl 1295.94111

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, 738-755 (2012).
MSC:  94A60 68P25
PDFBibTeX XMLCite
Full Text: DOI

Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. (English) Zbl 1267.94125

Matsui, Mitsuru (ed.), Advances in cryptology – ASIACRYPT 2009. 15th international conference on the theory and application of cryptology and information security, Tokyo, Japan, December 6–10, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10365-0/pbk). Lecture Notes in Computer Science 5912, 598-616 (2009).
MSC:  94A62
PDFBibTeX XMLCite
Full Text: DOI

Lattice-based identification schemes secure under active attacks. (English) Zbl 1162.94388

Cramer, Ronald (ed.), Public key cryptography – PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9–12, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78440-1/pbk). Lecture Notes in Computer Science 4939, 162-179 (2008).
MSC:  94A60 94A62
PDFBibTeX XMLCite
Full Text: DOI

The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. (English) Zbl 1142.68399

Chekuri, Chandra (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 8th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2005, and 9th international workshop on randomization and computation, RANDOM 2005, Berkeley, CA, USA, August 22–24, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28239-4/pbk). Lecture Notes in Computer Science 3624, 378-389 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Year of Publication

Main Field

Software