Sciweavers

285 search results - page 32 / 57
» Computationally Sound, Automated Proofs for Security Protoco...
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
14 years 8 months ago
Proofs of Retrievability via Hardness Amplification
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs
CAV
2007
Springer
111views Hardware» more  CAV 2007»
13 years 11 months ago
Verification Across Intellectual Property Boundaries
In many industries, the share of software components provided by third-party suppliers is steadily increasing. As the suppliers seek to secure their intellectual property (IP) righ...
Sagar Chaki, Christian Schallhart, Helmut Veith
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
13 years 11 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
ICALP
2005
Springer
14 years 1 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi
CSFW
2009
IEEE
13 years 11 months ago
Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code
Specification documents for real-world authentication protocols typically mandate some aspects of a protocol's behavior but leave other features optional or undefined. In add...
Phillip Rogaway, Till Stegers