Tight security proofs for the bounded-storage model

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Stefan Dziembowski ETH Zurich, Switzerland
Ueli Maurer ETH Zurich, Switzerland
Published in:
Cover Image
 
· Proceeding
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Pages 341 - 350
ACM New York, NY, USA ©2002
table of contents ISBN:1-58113-495-9 doi>10.1145/509907.509960
Tight security proofs for the bounded-storage model Published by ACM 2002 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 16
· Downloads (cumulative): 324
· Citation Count: 9


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder