Attacking cryptographic schemes based on perturbation polynomials

doi:10.1145/1653662.1653664

Attacking cryptographic schemes based on "perturbation polynomials"

Full Text:

PDF

Buy this Article

Authors:	Martin Albrecht	Royal Holloway, University of London, London, United Kingdom
	Craig Gentry	IBM T.J. Watson Research Center, Hawthorne, NY, USA
	Shai Halevi	IBM T.J. Watson Research Center, Hawthorne, NY, USA
	Jonathan Katz	University of Maryland, College Park, MD, USA

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 10 · Downloads (12 Months): 89 · Citation Count: 1

Published in:

	· Proceeding
	CCS '09 Proceedings of the 16th ACM conference on Computer and communications security
	ACM New York, NY, USA ©2009 table of contents ISBN: 978-1-60558-894-0 doi>10.1145/1653662.1653664

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- CCS'12

Tags: algorithms pairwise key establishment random perturbation polynomial security security and protection sensor network security

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player