Sciweavers

24 search results - page 2 / 5
» A New Sampling Protocol and Applications to Basing Cryptogra...
Sort
View
CN
2006
117views more  CN 2006»
13 years 4 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
FOCS
2010
IEEE
13 years 2 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
SIGOPS
1998
123views more  SIGOPS 1998»
13 years 4 months ago
A New Family of Authentication Protocols
Abstract. We present a related family of authentication and digital signature protocols based on symmetric cryptographic primitives which perform substantially better than previous...
Ross J. Anderson, Francesco Bergadano, Bruno Crisp...
CORR
2010
Springer
176views Education» more  CORR 2010»
13 years 5 months ago
Abstraction for Epistemic Model Checking of Dining Cryptographers-based Protocols
ion for Epistemic Model Checking of Dining Cryptographers-based Protocols Omar I. Al-Bataineh and Ron van der Meyden School of Computer Science and Engineering, University of New S...
Omar I. Al-Bataineh, Ron van der Meyden
ECCC
2007
123views more  ECCC 2007»
13 years 4 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters