Sciweavers

82 search results - page 7 / 17
» Deciding knowledge properties of security protocols
Sort
View
TAMC
2007
Springer
14 years 3 months ago
A Note on Universal Composable Zero Knowledge in Common Reference String Model
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
CCS
2011
ACM
12 years 9 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
14 years 1 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba
AAI
2004
114views more  AAI 2004»
13 years 9 months ago
Model Checking A Knowledge Exchange Scenario
We are interested in applying model checking techniques to the verification of communication protocols which require safe communication. Typically, in such scenarios, one desires ...
Sieuwert van Otterloo, Wiebe Der, Michael Wooldrid...