International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers

Authors:
Yuanmi Chen
Phong Q. Nguyen
Download:
DOI: 10.1007/978-3-642-29011-4_30 (login may be required)
URL: https://www.iacr.org/archive/eurocrypt2012/72370497/72370497.pdf
Search ePrint
Search Google
Presentation: Slides
Conference: EUROCRYPT 2012
Video from EUROCRYPT 2012
BibTeX
@inproceedings{eurocrypt-2012-24254,
  title={Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers},
  booktitle={EUROCRYPT},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={7237},
  pages={502-519},
  url={https://www.iacr.org/archive/eurocrypt2012/72370497/72370497.pdf},
  doi={10.1007/978-3-642-29011-4_30},
  author={Yuanmi Chen and Phong Q. Nguyen},
  year=2012
}