Sciweavers

1059 search results - page 139 / 212
» Modeling Security Protocols as Games
Sort
View
EUROCRYPT
2007
Springer
14 years 4 months ago
Simulatable Adaptive Oblivious Transfer
We study an adaptive variant of oblivious transfer in which a sender has N messages, of which a receiver can adaptively choose to receive k one-after-the-other, in such a way that ...
Jan Camenisch, Gregory Neven, Abhi Shelat
JALC
2006
61views more  JALC 2006»
13 years 10 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
ICISC
2001
156views Cryptology» more  ICISC 2001»
13 years 11 months ago
A Distributed Light-Weight Authentication Model for Ad-hoc Networks
Abstract. In this work we present a security model for low-value transactions in ad-hoc networks in which we focus on authentication since this is the core requirement for commerci...
André Weimerskirch, Gilles Thonet
FOCS
2007
IEEE
14 years 4 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
CCS
2011
ACM
12 years 10 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...