BibTeX records: Anja Becker 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Anja Becker 0001

download as .bib file

@article{DBLP:journals/iacr/BeckerK17,
  author    = {Anja Becker and
               Dusan Kostic},
  title     = {Speeding up lattice sieve with Xeon Phi coprocessor},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2017},
  pages     = {592},
  year      = {2017},
  url       = {http://eprint.iacr.org/2017/592},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerK17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/africacrypt/BeckerL16,
  author    = {Anja Becker and
               Thijs Laarhoven},
  editor    = {David Pointcheval and
               Abderrahmane Nitaj and
               Tajjeeddine Rachidi},
  title     = {Efficient (Ideal) Lattice Sieving Using Cross-Polytope {LSH}},
  booktitle = {Progress in Cryptology - {AFRICACRYPT} 2016 - 8th International Conference
               on Cryptology in Africa, Fes, Morocco, April 13-15, 2016, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9646},
  pages     = {3--23},
  publisher = {Springer},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-31517-1\_1},
  doi       = {10.1007/978-3-319-31517-1\_1},
  timestamp = {Tue, 14 May 2019 10:00:52 +0200},
  biburl    = {https://dblp.org/rec/conf/africacrypt/BeckerL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BeckerDGL16,
  author    = {Anja Becker and
               L{\'{e}}o Ducas and
               Nicolas Gama and
               Thijs Laarhoven},
  editor    = {Robert Krauthgamer},
  title     = {New directions in nearest neighbor searching with applications to
               lattice sieving},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {10--24},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch2},
  doi       = {10.1137/1.9781611974331.ch2},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/BeckerDGL16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerGJ15,
  author    = {Anja Becker and
               Nicolas Gama and
               Antoine Joux},
  title     = {Speeding-up lattice sieving without increasing the memory, using sub-quadratic
               nearest neighbor search},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2015},
  pages     = {522},
  year      = {2015},
  url       = {http://eprint.iacr.org/2015/522},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerGJ15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerL15,
  author    = {Anja Becker and
               Thijs Laarhoven},
  title     = {Efficient (ideal) lattice sieving using cross-polytope {LSH}},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2015},
  pages     = {823},
  year      = {2015},
  url       = {http://eprint.iacr.org/2015/823},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerL15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerDGL15,
  author    = {Anja Becker and
               L{\'{e}}o Ducas and
               Nicolas Gama and
               Thijs Laarhoven},
  title     = {New directions in nearest neighbor searching with applications to
               lattice sieving},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2015},
  pages     = {1128},
  year      = {2015},
  url       = {http://eprint.iacr.org/2015/1128},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerDGL15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerGJ13,
  author    = {Anja Becker and
               Nicolas Gama and
               Antoine Joux},
  title     = {Solving shortest and closest vector problems: The decomposition approach},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2013},
  pages     = {685},
  year      = {2013},
  url       = {http://eprint.iacr.org/2013/685},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerGJ13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/eurocrypt/BeckerJMM12,
  author    = {Anja Becker and
               Antoine Joux and
               Alexander May and
               Alexander Meurer},
  editor    = {David Pointcheval and
               Thomas Johansson},
  title     = {Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves
               Information Set Decoding},
  booktitle = {Advances in Cryptology - {EUROCRYPT} 2012 - 31st Annual International
               Conference on the Theory and Applications of Cryptographic Techniques,
               Cambridge, UK, April 15-19, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7237},
  pages     = {520--536},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-29011-4\_31},
  doi       = {10.1007/978-3-642-29011-4\_31},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/eurocrypt/BeckerJMM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerJMM12,
  author    = {Anja Becker and
               Antoine Joux and
               Alexander May and
               Alexander Meurer},
  title     = {Decoding Random Binary Linear Codes in 2\({}^{\mbox{n/20}}\): How
               1+1=0 Improves Information Set Decoding},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2012},
  pages     = {26},
  year      = {2012},
  url       = {http://eprint.iacr.org/2012/026},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerJMM12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/eurocrypt/BeckerCJ11,
  author    = {Anja Becker and
               Jean{-}S{\'{e}}bastien Coron and
               Antoine Joux},
  editor    = {Kenneth G. Paterson},
  title     = {Improved Generic Algorithms for Hard Knapsacks},
  booktitle = {Advances in Cryptology - {EUROCRYPT} 2011 - 30th Annual International
               Conference on the Theory and Applications of Cryptographic Techniques,
               Tallinn, Estonia, May 15-19, 2011. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6632},
  pages     = {364--385},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-20465-4\_21},
  doi       = {10.1007/978-3-642-20465-4\_21},
  timestamp = {Tue, 14 May 2019 10:00:54 +0200},
  biburl    = {https://dblp.org/rec/conf/eurocrypt/BeckerCJ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iacr/BeckerCJ11,
  author    = {Anja Becker and
               Jean{-}S{\'{e}}bastien Coron and
               Antoine Joux},
  title     = {Improved Generic Algorithms for Hard Knapsacks},
  journal   = {{IACR} Cryptol. ePrint Arch.},
  volume    = {2011},
  pages     = {474},
  year      = {2011},
  url       = {http://eprint.iacr.org/2011/474},
  timestamp = {Mon, 11 May 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/iacr/BeckerCJ11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/drm/BeckerAS08,
  author    = {Anja Becker and
               Alapan Arnab and
               Merc{\`{e}} Serra},
  editor    = {Gregory L. Heileman and
               Marc Joye},
  title     = {Assessing privacy criteria for drm using eu privacy legislation},
  booktitle = {Proceedings of the 8th {ACM} Workshop on Digital Rights Management,
               Alexandria, VA, USA, October 27, 2008},
  pages     = {77--86},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1456520.1456534},
  doi       = {10.1145/1456520.1456534},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/drm/BeckerAS08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.