Sciweavers

91 search results - page 4 / 19
» Bounded Key-Dependent Message Security
Sort
View
EUROCRYPT
2004
Springer
13 years 11 months ago
Optimal Communication Complexity of Generic Multicast Key Distribution
We prove a tight lower bound for generic protocols for secure multicast key distribution where the messages sent by the group manager for rekeying the group are obtained by arbitra...
Daniele Micciancio, Saurabh Panjwani
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
13 years 11 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi
TIT
2008
84views more  TIT 2008»
13 years 5 months ago
Information Theoretic Bounds on Authentication Systems in Query Model
Authentication codes provide message integrity guarantees in an information theoretic sense within a symmetric key setting. Information theoretic bounds on the success probability...
Reihaneh Safavi-Naini, Peter R. Wild
IFIP
2010
Springer
13 years 18 days ago
Bounded Memory Dolev-Yao Adversaries in Collaborative Systems
Abstract. This paper extends existing models for collaborative systems. We investigate how much damage can be done by insiders alone, without collusion with an outside adversary. I...
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, ...
TPHOL
2009
IEEE
14 years 12 days ago
Let's Get Physical: Models and Methods for Real-World Security Protocols
Traditional security protocols are mainly concerned with key establishment and principal authentication and rely on predistributed keys and properties of cryptographic operators. I...
David A. Basin, Srdjan Capkun, Patrick Schaller, B...