Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

STOC
2002
ACM

favoriteEmaildiscussreport

97views Algorithms» more STOC 2002»

Tight security proofs for the bounded-storage model

14 years 5 months ago

Tight security proofs for the bounded-storage model

Download www.dziembowski.net

Stefan Dziembowski, Ueli M. Maurer

Real-time Traffic

Algorithms | STOC 2002 | Tight Security Proofs |

claim paper

Related Content

» The Bare BoundedStorage Model The Tight Bound on the Storage Requirement for Key Agreement

» Secure Code Update for Embedded Devices via Proofs of Secure Erasure

» Exponential separations for oneway quantum communication complexity with applications to c...

» The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures

» The Twin DiffieHellman Problem and Applications

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Stefan Dziembowski, Ueli M. Maurer

Comments (0)