Sciweavers

6 search results - page 1 / 2
» Tight security proofs for the bounded-storage model
Sort
View
TIT
2008
187views more  TIT 2008»
13 years 5 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
STOC
2002
ACM
97views Algorithms» more  STOC 2002»
14 years 6 months ago
Tight security proofs for the bounded-storage model
Stefan Dziembowski, Ueli M. Maurer
ESORICS
2010
Springer
13 years 7 months ago
Secure Code Update for Embedded Devices via Proofs of Secure Erasure
Remote attestation is the process of verifying internal state of a remote embedded device. It is an important component of many security protocols and applications. Although previo...
Daniele Perito, Gene Tsudik
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 6 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
EUROCRYPT
2004
Springer
13 years 11 months ago
The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures
For the last two decades the notion and implementations of proxy signatures have been used to allow transfer of digital signing power within some context (in order to enable flexi...
Tal Malkin, Satoshi Obana, Moti Yung