Sciweavers

273 search results - page 53 / 55
» Modular Security Proofs for Key Agreement Protocols
Sort
View
IJACT
2008
136views more  IJACT 2008»
14 years 11 months ago
Anonymous RFID authentication supporting constant-cost key-lookup against active adversaries
: In the absence of sufficiently optimised public key constructions, anonymous authentication for Radio-Frequency Identification Devices (RFIDs) requires state synchronisation betw...
Mike Burmester, Breno de Medeiros, Rossana Motta
EUROCRYPT
2005
Springer
15 years 5 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
15 years 5 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
SEFM
2007
IEEE
15 years 5 months ago
Verifying the Mondex Case Study
The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those effor...
Peter H. Schmitt, Isabel Tonin
JOC
2011
104views more  JOC 2011»
14 years 2 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay