@article{HILL99,
title = {A pseudorandom generator from any one-way function},
author = {H{\aa}stad, Johan and Impagliazzo, Russell and Levin, Leonid A and Luby, Michael},
journal = {SIAM Journal on Computing},
volume = {28},
number = {4},
pages = {1364--1396},
year = {1999},
publisher = {SIAM}
}
@book{Katzbook10,
author = {Jonathan Katz},
title = {Digital Signatures},
publisher = {Springer},
year = {2010},
url = {http://dx.doi.org/10.1007/978-0-387-27712-7},
doi = {10.1007/978-0-387-27712-7},
isbn = {978-0-387-27711-0}
}
@comment{{MQ}}
@misc{WP05,
author = {Christopher Wolf and Bart Preneel},
title = {Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations},
howpublished = {Cryptology ePrint Archive, Report 2005/077},
year = {2005},
url = {http://eprint.iacr.org/2005/077}
}
@article{Buch65,
title = {Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal},
author = {Buchberger, Bruno},
journal = {Journal of symbolic computation},
volume = {41},
number = {3},
pages = {475--511},
year = {2006},
publisher = {Elsevier}
}
@book{Stu02,
title = {Solving systems of polynomial equations},
author = {Sturmfels, Bernd},
number = {97},
year = {2002},
publisher = {American Mathematical Soc.}
}
@article{EF14,
title = {A survey on signature-based {Gr{\"o}bner} basis computations},
author = {Eder, Christian and Faugere, Jean-Charles},
journal = {arXiv preprint arXiv:1404.1774},
year = {2014}
}
@inproceedings{MI88,
title = {Public quadratic polynomial-tuples for efficient signature-verification and message-encryption},
author = {Matsumoto, Tsutomu and Imai, Hideki},
booktitle = {Advances in Cryptology--EUROCRYPT 1988},
pages = {419--453},
year = {1988},
organization = {Springer}
}
@inproceedings{Patarin96,
title = {Hidden fields equations ({HFE}) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms},
author = {Patarin, Jacques},
booktitle = {Advances in Cryptology--EUROCRYPT 1996},
pages = {33--48},
year = {1996},
organization = {Springer}
}
@misc{BFS03,
title = {Complexity of {Gr{\"o}bner} basis computation for
Semi-regular Overdetermined sequences over
$\mathbb{F}_2$ with solutions in $\mathbb{F}_2$},
author = {Bardet, Magali and Faugere, Jean-Charles and Salvy, Bruno},
year = {2003},
note = {Tech Report available at \url{https://hal.inria.fr/inria-00071534}}
}
@incollection{BFV13,
title = {Graph-theoretic algorithms for the ``isomorphism of
polynomials'' problem},
author = {Bouillaguet, Charles and Fouque, Pierre-Alain and V{\'e}ber,
Amandine},
booktitle = {Advances in Cryptology--EUROCRYPT 2013},
pages = {211--227},
year = {2013},
publisher = {Springer}
}
@comment{{HASH}}
@article{Lamport79,
title = {Constructing digital signatures from a one-way function},
author = {Lamport, Leslie},
journal = {Tech. Report: SRI International Computer Science Laboratory},
year = {1979}
}
@inproceedings{Mer90,
title = {A Certified Digital Signature},
author = {Merkle, Ralph C},
booktitle = {Advances in Cryptology--CRYPTO 1989},
pages = {218--238},
year = {1990},
organization = {Springer}
}
@incollection{BDH11,
title = {XMSS-a practical forward secure signature scheme based on minimal security assumptions},
author = {Buchmann, Johannes and Dahmen, Erik and H{\"u}lsing, Andreas},
booktitle = {Post-Quantum Cryptography},
pages = {117--129},
year = {2011},
publisher = {Springer}
}
@incollection{BHH+15,
title = {{SPHINCS}: practical stateless hash-based signatures},
author = {Bernstein, Daniel J and Hopwood, Daira and H{\"u}lsing,
Andreas and Lange, Tanja and Niederhagen, Ruben and
Papachristodoulou, Louiza and Schneider, Michael and
Schwabe, Peter and Wilcox-O'Hearn, Zooko},
booktitle = {Advances in Cryptology--EUROCRYPT 2015},
pages = {368--397},
year = {2015},
publisher = {Springer}
}
@comment{{lattice crypto}}
@misc{Pei15_survey,
author = {Chris Peikert},
title = {A Decade of Lattice Cryptography},
howpublished = {Cryptology ePrint Archive, Report 2015/939},
year = {2015}
}
@article{Reg09,
title = {On lattices, learning with errors, random linear codes, and cryptography},
author = {Regev, Oded},
journal = {Journal of the ACM (JACM)},
volume = {56},
number = {6},
pages = {34},
year = {2009},
publisher = {ACM}
}
@incollection{Lyu09,
title = {Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures},
author = {Lyubashevsky, Vadim},
booktitle = {Advances in Cryptology--ASIACRYPT 2009},
pages = {598--616},
year = {2009},
publisher = {Springer}
}
@incollection{Lyu08,
title = {Lattice-based identification schemes secure under active attacks},
author = {Lyubashevsky, Vadim},
booktitle = {Public Key Cryptography--PKC 2008},
pages = {162--179},
year = {2008},
publisher = {Springer}
}
@incollection{KTX08,
title = {Concurrently secure identification schemes based on the worst-case hardness of lattice problems},
author = {Kawachi, Akinori and Tanaka, Keisuke and Xagawa, Keita},
booktitle = {Advances in Cryptology-ASIACRYPT 2008},
pages = {372--389},
year = {2008},
publisher = {Springer}
}
@incollection{Lyu12_fs,
title = {Lattice signatures without trapdoors},
author = {Lyubashevsky, Vadim},
booktitle = {Advances in Cryptology--EUROCRYPT 2012},
pages = {738--755},
year = {2012},
publisher = {Springer}
}
@incollection{DDLL13,
title = {Lattice signatures and bimodal Gaussians},
author = {Ducas, L{\'e}o and Durmus, Alain and Lepoint, Tancr{\`e}de and Lyubashevsky, Vadim},
booktitle = {Advances in Cryptology--CRYPTO 2013},
pages = {40--56},
year = {2013},
publisher = {Springer}
}
@inproceedings{GPV08,
title = {Trapdoors for hard lattices and new cryptographic constructions},
author = {Gentry, Craig and Peikert, Chris and Vaikuntanathan, Vinod},
booktitle = {Proceedings of the {Fourteenth} annual ACM symposium on
Theory of computing},
pages = {197--206},
year = {2008},
organization = {ACM}
}
@inproceedings{Peikert09,
title = {Public-key cryptosystems from the worst-case shortest vector problem},
author = {Peikert, Chris},
booktitle = {Proceedings of the {Forty-First} annual ACM symposium on Theory of computing},
pages = {333--342},
year = {2009},
organization = {ACM}
}
@misc{MicPKC10,
title = { Duality in lattice cryptography},
author = {Daniele Micciancio},
howpublished = {Invited talk at Public Key Cryptography},
year = {2010},
note = {Slides available at
\url{https://cseweb.ucsd.edu/~daniele/papers/DualitySlides.pdf}}
}
@incollection{MP12,
title = {Trapdoors for lattices: Simpler, tighter, faster, smaller},
author = {Micciancio, Daniele and Peikert, Chris},
booktitle = {Advances in Cryptology--EUROCRYPT 2012},
pages = {700--718},
year = {2012},
publisher = {Springer}
}
@incollection{Boy10,
title = {Lattice mixing and vanishing trapdoors: A framework for fully secure short signatures and more},
author = {Boyen, Xavier},
booktitle = {Public Key Cryptography--PKC 2010},
pages = {499--517},
year = {2010},
publisher = {Springer}
}
@article{CHKP12,
title = {Bonsai trees, or how to delegate a lattice basis},
author = {Cash, David and Hofheinz, Dennis and Kiltz, Eike and Peikert, Chris},
journal = {Journal of Cryptology},
volume = {25},
number = {4},
pages = {601--639},
year = {2012},
publisher = {Springer},
note = {Preliminary version in Eurocrypt 2010}
}
@incollection{DM14,
title = {Improved short lattice signatures in the standard model},
author = {Ducas, L{\'e}o and Micciancio, Daniele},
booktitle = {Advances in Cryptology--CRYPTO 2014},
pages = {335--352},
year = {2014},
publisher = {Springer}
}
@incollection{Alperin15,
title = {Short signatures with short public keys from homomorphic trapdoor functions},
author = {Alperin-Sheriff, Jacob},
booktitle = {Public-Key Cryptography--PKC 2015},
pages = {236--255},
year = {2015},
publisher = {Springer}
}
@incollection{PR06,
title = {Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices},
author = {Peikert, Chris and Rosen, Alon},
booktitle = {Theory of Cryptography},
pages = {145--166},
year = {2006},
publisher = {Springer}
}
@incollection{LM06,
title = {Generalized compact knapsacks are collision resistant},
author = {Lyubashevsky, Vadim and Micciancio, Daniele},
booktitle = {Automata, Languages and Programming},
pages = {144--155},
year = {2006},
publisher = {Springer}
}
@incollection{SSTX09,
title = {Efficient public key encryption based on ideal lattices},
author = {Stehl{\'e}, Damien and Steinfeld, Ron and Tanaka, Keisuke and Xagawa, Keita},
booktitle = {Advances in Cryptology--ASIACRYPT 2009},
pages = {617--635},
year = {2009},
publisher = {Springer}
}
@article{PW11,
title = {Lossy trapdoor functions and their applications},
author = {Peikert, Chris and Waters, Brent},
journal = {SIAM Journal on Computing},
volume = {40},
number = {6},
pages = {1803--1844},
year = {2011},
publisher = {SIAM},
note = {Preliminary version in STOC 2008}
}
@article{LPR13,
title = {On ideal lattices and learning with errors over rings},
author = {Lyubashevsky, Vadim and Peikert, Chris and Regev, Oded},
journal = {Journal of the ACM (JACM)},
volume = {60},
number = {6},
pages = {43},
year = {2013},
publisher = {ACM},
note = {Preliminary version in Eurocrypt 2010}
}
@misc{SS13,
title = {Making NTRUEncrypt and NTRUSign as Secure as Standard Worst-Case Problems over Ideal Lattices.},
author = {Stehl{\'e}, Damien and Steinfeld, Ron},
howpublished = {Cryptology ePrint Archive, Report 2013/004},
year = {2013},
note = {Preliminary version in Eurocrypt 2011}
}
@incollection{HPS98,
title = {NTRU: A ring-based public key cryptosystem},
author = {Hoffstein, Jeffrey and Pipher, Jill and Silverman, Joseph H},
booktitle = {Algorithmic number theory},
pages = {267--288},
year = {1998},
publisher = {Springer}
}
@incollection{GGH97,
title = {Public-key cryptosystems from lattice reduction problems},
author = {Goldreich, Oded and Goldwasser, Shafi and Halevi, Shai},
booktitle = {Advances in Cryptology--CRYPTO 1997},
pages = {112--131},
year = {1997},
publisher = {Springer}
}
@incollection{HPS01,
title = {NSS: An NTRU lattice-based signature scheme},
author = {Hoffstein, Jeffrey and Pipher, Jill and Silverman, Joseph H},
booktitle = {Advances in Cryptology--Eurocrypt 2001},
pages = {211--228},
year = {2001},
publisher = {Springer}
}
@incollection{HHGP+03,
title = {NTRUSIGN: Digital signatures using the NTRU lattice},
author = {Hoffstein, Jeffrey and Howgrave-Graham, Nick and Pipher,
Jill and Silverman, Joseph H and Whyte, William},
booktitle = {Topics in Cryptology--CT-RSA 2003},
pages = {122--140},
year = {2003},
publisher = {Springer}
}
@inproceedings{GS02,
title = {Cryptanalysis of the revised {NTRU} signature scheme},
author = {Gentry, Craig and Szydlo, Mike},
booktitle = {Advances in Cryptology--EUROCRYPT 2002},
pages = {299--320},
year = {2002},
organization = {Springer}
}
@article{NR09,
title = {Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures},
author = {Nguyen, Phong Q and Regev, Oded},
journal = {Journal of Cryptology},
volume = {22},
number = {2},
pages = {139--160},
year = {2009},
publisher = {Springer},
note = {Preliminary version in Eurocrypt 2006}
}
@incollection{DN12,
title = {Learning a zonotope and more: Cryptanalysis of NTRUSign countermeasures},
author = {Ducas, L{\'e}o and Nguyen, Phong Q},
booktitle = {Advances in Cryptology--ASIACRYPT 2012},
pages = {433--450},
year = {2012},
publisher = {Springer}
}
@inproceedings{Ajt96,
title = {Generating hard instances of lattice problems},
author = {Ajtai, Mikl{\'o}s},
booktitle = {Proceedings of the twenty-eighth annual ACM symposium on Theory of computing},
pages = {99--108},
year = {1996},
organization = {ACM}
}
@article{MR04,
title = {Worst-case to average-case reductions based on Gaussian measures},
author = {Micciancio, Daniele and Regev, Oded},
journal = {SIAM Journal on Computing},
volume = {37},
number = {1},
pages = {267--302},
year = {2007},
publisher = {SIAM},
note = {Preliminary version in FOCS 2004}
}
@article{Mic07,
title = {Generalized compact knapsacks, cyclic lattices, and efficient one-way functions},
author = {Micciancio, Daniele},
journal = {Computational Complexity},
volume = {16},
number = {4},
pages = {365--411},
year = {2007},
publisher = {Springer},
note = {Preliminary version in FOCS 2002}
}
@inproceedings{BLP+13,
title = {Classical hardness of learning with errors},
author = {Brakerski, Zvika and Langlois, Adeline and Peikert, Chris and Regev, Oded and Stehl{\'e}, Damien},
booktitle = {Proceedings of the Forty-Fifth annual ACM symposium on
Theory of computing},
pages = {575--584},
year = {2013},
organization = {ACM}
}
@incollection{Ajtai99,
title = {Generating hard instances of the short basis problem},
author = {Ajtai, Mikl{\'o}s},
booktitle = {Automata, Languages and Programming},
pages = {1--9},
year = {1999},
publisher = {Springer}
}
@article{AP11,
title = {Generating shorter bases for hard random lattices},
author = {Alwen, Jo{\"e}l and Peikert, Chris},
journal = {Theory of Computing Systems},
volume = {48},
number = {3},
pages = {535--553},
year = {2011},
publisher = {Springer},
note = {Preliminary version in STACS 2009}
}
@incollection{Peikert14,
title = {Lattice cryptography for the internet},
author = {Peikert, Chris},
booktitle = {Post-Quantum Cryptography},
pages = {197--219},
year = {2014},
publisher = {Springer}
}
@article{Peikert08_lp,
title = {Limits on the hardness of lattice problems in $\ell_p$ norms},
author = {Peikert, Chris},
journal = {Computational Complexity},
volume = {17},
number = {2},
pages = {300--351},
year = {2008},
publisher = {Springer}
}
@article{LLL82,
title = {Factoring polynomials with rational coefficients},
author = {Lenstra, Arjen Klaas and Lenstra, Hendrik Willem and Lov{\'a}sz, L{\'a}szl{\'o}},
journal = {Mathematische Annalen},
volume = {261},
number = {4},
pages = {515--534},
year = {1982},
publisher = {Springer}
}
@article{Schnorr87,
title = {A hierarchy of polynomial time lattice basis reduction algorithms},
author = {Schnorr, Claus-Peter},
journal = {Theoretical computer science},
volume = {53},
number = {2},
pages = {201--224},
year = {1987},
publisher = {Elsevier}
}
@incollection{CNBKZ11,
title = {BKZ 2.0: Better lattice security estimates},
author = {Chen, Yuanmi and Nguyen, Phong Q},
booktitle = {Advances in Cryptology--ASIACRYPT 2011},
pages = {1--20},
year = {2011},
publisher = {Springer}
}
@inproceedings{Kannan83,
title = {Improved algorithms for integer programming and related lattice problems},
author = {Kannan, Ravi},
booktitle = {Proceedings of the Fifteenth annual ACM symposium on
Theory of computing},
pages = {193--206},
year = {1983},
organization = {ACM}
}
@incollection{GNR10,
title = {Lattice enumeration using extreme pruning},
author = {Gama, Nicolas and Nguyen, Phong Q and Regev, Oded},
booktitle = {Advances in Cryptology--EUROCRYPT 2010},
pages = {257--278},
year = {2010},
publisher = {Springer}
}
@inproceedings{AKS01,
title = {A sieve algorithm for the shortest lattice vector problem},
author = {Ajtai, Mikl{\'o}s and Kumar, Ravi and Sivakumar, Dandapani},
booktitle = {Proceedings of the Thirty-third annual ACM symposium on Theory of computing},
pages = {601--610},
year = {2001},
organization = {ACM}
}
@inproceedings{MVSODA10,
title = {Faster exponential time algorithms for the shortest vector problem},
author = {Micciancio, Daniele and Voulgaris, Panagiotis},
booktitle = {Proceedings of the Twenty-first annual ACM-SIAM symposium
on Discrete Algorithms},
pages = {1468--1480},
year = {2010},
organization = {Society for Industrial and Applied Mathematics}
}
@article{MV13,
title = {A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations},
author = {Micciancio, Daniele and Voulgaris, Panagiotis},
journal = {SIAM Journal on Computing},
volume = {42},
number = {3},
pages = {1364--1391},
year = {2013},
publisher = {SIAM},
note = {Preliminary version in STOC 2010}
}
@inproceedings{ADRSD15,
title = {Solving the Shortest Vector Problem in $2^n$ Time Using Discrete Gaussian Sampling},
author = {Aggarwal, Divesh and Dadush, Daniel and Regev, Oded and Stephens-Davidowitz, Noah},
booktitle = {Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing},
pages = {733--742},
year = {2015},
organization = {ACM}
}
@inproceedings{Ajt98,
title = {The shortest vector problem in L 2 is NP-hard for randomized reductions},
author = {Ajtai, Mikl{\'o}s},
booktitle = {Proceedings of the thirtieth annual ACM symposium on Theory of computing},
pages = {10--19},
year = {1998},
organization = {ACM}
}
@article{Mic01,
title = {The shortest vector in a lattice is hard to approximate to within some constant},
author = {Micciancio, Daniele},
journal = {SIAM journal on Computing},
volume = {30},
number = {6},
pages = {2008--2035},
year = {2001},
publisher = {SIAM},
note = {Preliminary version in FOCS 1998}
}
@article{Khot05,
title = {Hardness of approximating the shortest vector problem in lattices},
author = {Khot, Subhash},
journal = {Journal of the ACM (JACM)},
volume = {52},
number = {5},
pages = {789--808},
year = {2005},
publisher = {ACM},
note = {Preliminary version in FOCS 2003}
}
@comment{{Code-based}}
@article{McE78,
title = {A public-key cryptosystem based on algebraic coding theory},
author = {McEliece, RJ},
year = {1978},
journal = {The Deep Space Network Progress Report},
volume = {42},
number = {44},
pages = {114--116}
}
@article{Nie86,
title = {Knapsack-type cryptosystems and algebraic coding theory},
author = {Harald Niederreiter},
journal = {Problems of Control and Information Theory},
volume = {15},
pages = {19--34},
year = {1986},
note = {Problemy Upravlenija i Teorii Informacii 15, 159--166}
}
@inproceedings{Ale03,
title = {More on average case vs approximation complexity},
author = {Alekhnovich, Michael},
booktitle = {Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on},
pages = {298--307},
year = {2003},
organization = {IEEE}
}
@misc{EOS06_survey,
author = {D. Engelbert, R. Overbeck and A. Schmidt},
title = {A Summary of {McEliece}-Type Cryptosystems and their
Security},
howpublished = {Cryptology ePrint Archive, Report 2006/162},
year = {2006},
note = {\url{https://eprint.iacr.org/2006/162}}
}
@article{Stern96,
title = {A new paradigm for public key identification},
author = {Stern, Jacques},
journal = {Information Theory, IEEE Transactions on},
volume = {42},
number = {6},
pages = {1757--1768},
year = {1996},
publisher = {IEEE}
}
@incollection{CFS01,
title = {How to achieve a {McEliece}-based digital signature scheme},
author = {Courtois, Nicolas T and Finiasz, Matthieu and Sendrier, Nicolas},
booktitle = {Advances in Cryptology--ASIACRYPT 2001},
pages = {157--174},
year = {2001},
publisher = {Springer}
}
@incollection{Dallot07,
title = {Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme},
author = {Dallot, L{\'e}onard},
booktitle = {Research in Cryptology},
pages = {65--77},
year = {2007},
publisher = {Springer}
}
@article{FGOPT13,
title = {A distinguisher for high-rate {McEliece} cryptosystems},
author = {Faugere, Jean-Charles and Gauthier-Umana, Val{\'e}rie and Otmani, Ayoub and Perret, Ludovic and Tillich, Jean-Pierre},
journal = {Information Theory, IEEE Transactions on},
volume = {59},
number = {10},
pages = {6830--6844},
year = {2013},
publisher = {IEEE}
}
@inproceedings{KIPKC01,
title = {Semantically secure {McEliece} public-key cryptosystems-conversions for McEliece PKC},
author = {Kobara, Kazukuni and Imai, Hideki},
booktitle = {Public Key Cryptography},
pages = {19--35},
year = {2001},
organization = {Springer}
}
@article{NIKM08,
title = {Semantic security for the McEliece cryptosystem without random oracles},
author = {Nojima, Ryo and Imai, Hideki and Kobara, Kazukuni and Morozov, Kirill},
journal = {Designs, Codes and Cryptography},
volume = {49},
number = {1-3},
pages = {289--305},
year = {2008},
publisher = {Springer}
}
@article{RS10,
title = {Chosen-ciphertext security via correlated products},
author = {Rosen, Alon and Segev, Gil},
journal = {SIAM Journal on Computing},
volume = {39},
number = {7},
pages = {3058--3088},
year = {2010},
publisher = {SIAM},
note = {Preliminary version in STOC 2009}
}
@article{DDMQN12,
title = {A CCA2 secure variant of the {McEliece} cryptosystem},
author = {D{\"o}ttling, Nico and Dowsley, Rafael and M{\"u}ller-Quade, J{\"o}rn and Nascimento, Anderson CA},
journal = {Information Theory, IEEE Transactions on},
volume = {58},
number = {10},
pages = {6672--6680},
year = {2012},
publisher = {IEEE},
note = {Preliminary version in CT-RSA 2009}
}
@article{BMT78,
title = {On the inherent intractability of certain coding problems},
author = {Berlekamp, Elwyn R and McEliece, Robert J and Van Tilborg, Henk CA},
journal = {IEEE Transactions on Information Theory},
volume = {24},
number = {3},
pages = {384--386},
year = {1978}
}
@article{Vardy97,
title = {The intractability of computing the minimum distance of a code},
author = {Vardy, Alexander},
journal = {IEEE Transactions on Information Theory},
volume = {43},
number = {6},
pages = {1757--1766},
year = {1997}
}
@article{DMS03,
title = {Hardness of approximating the minimum distance of a linear code},
author = {Dumer, Ilya and Micciancio, Daniele and Sudan, Madhu},
journal = {Information Theory, IEEE Transactions on},
volume = {49},
number = {1},
pages = {22--37},
year = {2003},
publisher = {IEEE},
note = {Preliminary version in FOCS 1999}
}
@article{FM04,
title = {The inapproximability of lattice and coding problems with preprocessing},
author = {Feige, Uriel and Micciancio, Daniele},
journal = {Journal of Computer and System Sciences},
volume = {69},
number = {1},
pages = {45--67},
year = {2004},
publisher = {Academic Press, Inc.},
note = {Preliminary version in CCC 2002}
}
@article{Reg04_code,
title = {Improved inapproximability of lattice and coding problems with preprocessing},
author = {REGEV, Oded},
journal = {IEEE transactions on information theory},
volume = {50},
number = {9},
pages = {2031--2037},
year = {2004},
publisher = {Institute of Electrical and Electronics Engineers},
note = {Preliminary version in CCC 2003}
}
@article{GV05,
title = {Maximum-likelihood decoding of Reed-Solomon codes is
{NP}-hard},
author = {Guruswami, Venkatesan and Vardy, Alexander},
journal = {Information Theory, IEEE Transactions on},
volume = {51},
number = {7},
pages = {2249--2256},
year = {2005},
publisher = {IEEE},
note = {Preliminary version in SODA 2005}
}
@incollection{DMR11,
title = {{Mceliece} and {Niederreiter} cryptosystems that resist quantum fourier sampling attacks},
author = {Dinh, Hang and Moore, Cristopher and Russell, Alexander},
booktitle = {Advances in Cryptology--Crypto 2011},
pages = {761--779},
year = {2011},
publisher = {Springer}
}
@inproceedings{LB88,
title = {An observation on the security of McEliece's public-key
cryptosystem},
author = {Lee, Pil Joong and Brickell, Ernest F},
booktitle = {Advances in Cryptology--EUROCRYPT 1988},
pages = {275--280},
year = {1988},
organization = {Springer}
}
@article{Leon88,
title = {A probabilistic algorithm for computing minimum weights of large error-correcting codes},
author = {Leon, Jeffrey S},
journal = {IEEE Transactions on Information Theory},
volume = {34},
number = {5},
pages = {1354--1359},
year = {1988},
publisher = {IEEE}
}
@incollection{Stern88,
title = {A method for finding codewords of small weight},
author = {Stern, Jacques},
booktitle = {Coding theory and applications},
pages = {106--113},
year = {1988},
publisher = {Springer}
}
@incollection{BJMM12,
title = {Decoding random binary linear codes in {$2^{n/20}$}: How 1+
1= 0 improves information set decoding},
author = {Becker, Anja and Joux, Antoine and May, Alexander and
Meurer, Alexander},
booktitle = {Advances in Cryptology--EUROCRYPT 2012},
pages = {520--536},
year = {2012},
publisher = {Springer}
}
@article{Sen00,
title = {Finding the permutation between equivalent linear codes: The support splitting algorithm},
author = {Sendrier, Nicolas},
journal = {Information Theory, IEEE Transactions on},
volume = {46},
number = {4},
pages = {1193--1203},
year = {2000},
publisher = {IEEE}
}
@comment{{RO-Amplification}}
@article{CGH04,
title = {The random oracle methodology, revisited},
author = {Canetti, Ran and Goldreich, Oded and Halevi, Shai},
journal = {Journal of the ACM (JACM)},
volume = {51},
number = {4},
pages = {557--594},
year = {2004},
publisher = {ACM}
}
@inproceedings{BR93,
title = {Random oracles are practical: A paradigm for designing efficient protocols},
author = {Bellare, Mihir and Rogaway, Phillip},
booktitle = {Proceedings of the First ACM conference on Computer and
Communications Security},
pages = {62--73},
year = {1993},
organization = {ACM}
}
@inproceedings{BR94,
title = {Optimal asymmetric encryption},
author = {Bellare, Mihir and Rogaway, Phillip},
booktitle = {Advances in Cryptology--EUROCRYPT 1994},
pages = {92--111},
year = {1994},
organization = {Springer}
}
@inproceedings{BR96,
title = {The exact security of digital signatures-How to sign with RSA
and Rabin},
author = {Bellare, Mihir and Rogaway, Phillip},
booktitle = {Advances in Cryptology--Eurocrypt 1996},
pages = {399--416},
year = {1996},
organization = {Springer}
}
@inproceedings{Shoup01,
title = {{OAEP} reconsidered},
author = {Shoup, Victor},
booktitle = {Advances in Cryptology—-CRYPTO 2001},
pages = {239--259},
year = {2001},
organization = {Springer}
}
@inproceedings{PonPKC00,
title = {Chosen-ciphertext security for any one-way cryptosystem},
author = {Pointcheval, David},
booktitle = {Public Key Cryptography},
pages = {129--146},
year = {2000},
organization = {Springer}
}
@inproceedings{FO-C99,
author = {Eiichiro Fujisaki and
Tatsuaki Okamoto},
title = {Secure Integration of Asymmetric and Symmetric Encryption Schemes},
booktitle = {Advances in Cryptology--{CRYPTO} 1999},
pages = {537--554},
year = {1999},
doi = {10.1007/3-540-48405-1_34},
note = {Full version in Journal of Cryptology 2013}
}
@article{FO-JoC13,
title = {Secure integration of asymmetric and symmetric encryption schemes},
author = {Fujisaki, Eiichiro and Okamoto, Tatsuaki},
journal = {Journal of Cryptology},
volume = 26,
number = 1,
pages = {80--101},
year = 2013,
publisher = {Springer},
note = {Preliminary version in CRYPTO 1999}
}
@article{FOPS04,
title = {{RSA-OAEP} is secure under the RSA assumption},
author = {Fujisaki, Eiichiro and Okamoto, Tatsuaki and Pointcheval, David and Stern, Jacques},
journal = {Journal of Cryptology},
volume = {17},
number = {2},
pages = {81--104},
year = {2004},
publisher = {Springer},
note = {Prelim in CRYPTO 2001}
}
@incollection{OPCTRSA01,
title = {{REACT}: Rapid enhanced-security asymmetric cryptosystem
transform},
author = {Okamoto, Tatsuaki and Pointcheval, David},
booktitle = {Topics in Cryptology—CT-RSA 2001},
pages = {159--174},
year = {2001},
publisher = {Springer}
}
@comment{{Quantum algorithms & Quantum Security}}
@article{Reg04_dcp,
author = {Oded Regev},
title = {Quantum Computation and Lattice Problems},
journal = {SIAM J. Comput.},
volume = {33},
number = {3},
year = {2004},
pages = {738-760},
ee = {http://dx.doi.org/10.1137/S0097539703440678}
}
@inproceedings{EHKS14,
title = {A quantum algorithm for computing the unit group of an arbitrary degree number field},
author = {Eisentr{\"a}ger, Kirsten and Hallgren, Sean and Kitaev, Alexei and Song, Fang},
booktitle = {Proceedings of the 46th STOC},
pages = {293--302},
year = 2014,
organization = {ACM}
}
@inproceedings{BS16,
title = {Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields},
author = {Biasse, Jean-Fran{\c{c}}ois and Song, Fang},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms},
pages = {893--902},
year = {2016},
organization = {SIAM}
}
@misc{CDPR15,
author = {Ronald Cramer and L{\'e}o Ducas and Chris Peikert and Oded Regev},
title = {Recovering Short Generators of Principal Ideals in Cyclotomic Rings},
howpublished = {Cryptology ePrint Archive, Report 2015/313},
month = {October},
year = {2015}
}
@misc{CGS14,
author = {Peter Campbell and Michael Groves and Dan Shepherd},
title = {Soliloquy: A cautionary tale},
howpublished = {ETSI/IQC 2nd Quantum-Safe Crypto Workshop},
year = {2014}
}
@article{LMV15,
title = {Finding shortest lattice vectors faster using quantum search},
author = {Laarhoven, Thijs and Mosca, Michele and Van De Pol, Joop},
journal = {Designs, Codes and Cryptography},
volume = {77},
number = {2-3},
pages = {375--400},
year = {2015},
publisher = {Springer}
}
@inproceedings{DinMooRus11,
author = {Hang Dinh and
Cristopher Moore and
Alexander Russell},
title = {McEliece and {Niederreiter} Cryptosystems That Resist Quantum
Fourier Sampling Attacks},
booktitle = {CRYPTO},
year = {2011},
pages = {761-779},
ee = {http://dx.doi.org/10.1007/978-3-642-22792-9_43},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@misc{BS15,
title = {On the quantum attacks against schemes relying on the
hardness of finding a short generator of an ideal in
{$\mathbb{Q}(\zeta_{p^n})$}},
author = {Jean-Fran{\c{c}}ois Biasse and Fang Song},
howpublished = {Tech Report {CACR 2015-12}},
month = {September},
year = 2015
}
@article{Wat09,
author = {John Watrous},
journal = {SIAM J. Comput.},
note = {Preliminary version in STOC 2006},
number = {1},
pages = {25-58},
title = {Zero-Knowledge against Quantum Attacks},
volume = {39},
year = {2009}
}
@inproceedings{HSS11,
author = {Sean Hallgren and
Adam Smith and
Fang Song},
title = {Classical Cryptographic Protocols in a Quantum World},
booktitle = {Advances in Cryptology--Crypto 2011},
year = {2011},
pages = {411-428},
ee = {http://dx.doi.org/10.1007/978-3-642-22792-9_23},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@inproceedings{LunNie11,
author = {Carolin Lunemann and
Jesper Buus Nielsen},
title = {Fully Simulatable Quantum-Secure Coin-Flipping and Applications},
booktitle = {AFRICACRYPT},
year = {2011},
pages = {21-40},
ee = {http://dx.doi.org/10.1007/978-3-642-21969-6_2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@incollection{FKSZZ13,
title = {Feasibility and completeness of cryptographic tasks in the quantum world},
author = {Fehr, Serge and Katz, Jonathan and Song, Fang and Zhou, Hong-Sheng and Zikas, Vassilis},
booktitle = {Theory of Cryptography},
pages = {281--296},
year = {2013},
publisher = {Springer}
}
@article{HSS15,
title = {Classical cryptographic protocols in a quantum world},
author = {Hallgren, Sean and Smith, Adam and Song, Fang},
journal = {International Journal of Quantum Information},
volume = {13},
number = {04},
pages = {1550028},
year = {2015},
note = {Preliminary version appeared in Crypto'11},
publisher = {World Scientific}
}
@incollection{Unruh10,
title = {Universally composable quantum multi-party computation},
author = {Unruh, Dominique},
booktitle = {Advances in Cryptology--EUROCRYPT 2010},
pages = {486--505},
year = {2010},
publisher = {Springer}
}
@incollection{Son14,
title = {A note on quantum security for post-quantum
cryptography},
author = {Song, Fang},
booktitle = {Proceedings of the 6th International Workshop on
Post-Quantum Cryptography},
series = {Lecture Notes in Computer Science},
volume = 8772,
pages = {246--265},
year = 2014,
publisher = {Springer}
}
@inproceedings{ES15,
author = {Edward Eaton and
Fang Song},
title = {Making Existential-unforgeable Signatures Strongly Unforgeable in
the Quantum Random-oracle Model},
booktitle = {10th Conference on the Theory of Quantum Computation, Communication
and Cryptography {(TQC)}},
pages = {147--162},
year = {2015},
doi = {10.4230/LIPIcs.TQC.2015.147}
}
@incollection{BDFLSZ11,
title = {Random oracles in a quantum world},
author = {Boneh, Dan and Dagdelen, {\"O}zg{\"u}r and Fischlin, Marc and Lehmann, Anja and Schaffner, Christian and Zhandry, Mark},
booktitle = {Advances in Cryptology--ASIACRYPT 2011},
pages = {41--69},
year = {2011},
publisher = {Springer}
}
@inproceedings{Zha12a,
author = {Mark Zhandry},
title = {Secure Identity-Based Encryption in the Quantum Random
Oracle Model},
booktitle = {Proceedings of CRYPTO 2012},
misc = {Full version available at
\url{http://eprint.iacr.org/2012/076}},
year = {2012}
}
@incollection{Unr15,
title = {Non-interactive zero-knowledge proofs in the quantum random oracle model},
author = {Unruh, Dominique},
booktitle = {Advances in Cryptology-EUROCRYPT 2015},
pages = {755--784},
year = {2015},
publisher = {Springer}
}
@inproceedings{HRS16,
author = {Andreas H{\"{u}}lsing and
Joost Rijneveld and
Fang Song},
title = {Mitigating Multi-target Attacks in Hash-Based Signatures},
booktitle = {Public-Key Cryptography - {PKC} 2016 - 19th {IACR} International Conference
on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan,
March 6-9, 2016, Proceedings, Part {I}},
pages = {387--416},
year = {2016},
doi = {10.1007/978-3-662-49384-7_15}
}
This file was generated by bibtex2html 1.98.