Sciweavers

469 search results - page 16 / 94
» On Adversary Models and Compositional Security
Sort
View
TIT
2008
84views more  TIT 2008»
13 years 7 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
IMA
2005
Springer
85views Cryptology» more  IMA 2005»
14 years 1 months ago
The Physically Observable Security of Signature Schemes
In recent years much research has been devoted to producing formal models of security for cryptographic primitives and to designing schemes that can be proved secure in such models...
Alexander W. Dent, John Malone-Lee
EUROCRYPT
2004
Springer
14 years 1 months ago
Multi-party Computation with Hybrid Security
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
Matthias Fitzi, Thomas Holenstein, Jürg Wulls...
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
13 years 9 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
EUROCRYPT
2006
Springer
13 years 11 months ago
The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...
Mihir Bellare, Phillip Rogaway