Sciweavers

35 search results - page 3 / 7
» Partial Order Reduction for Branching Security Protocols
Sort
View
CCS
2006
ACM
13 years 9 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
ESORICS
2008
Springer
13 years 7 months ago
State Space Reduction in the Maude-NRL Protocol Analyzer
The Maude-NRL Protocol Analyzer (Maude-NPA) is a tool and inference system for reasoning about the security of cryptographic protocols in which the cryptosystems satisfy different ...
Santiago Escobar, Catherine Meadows, José M...
APN
2011
Springer
12 years 9 months ago
On the Origin of Events: Branching Cells as Stubborn Sets
In prime event structures with binary conflicts (pes-bc)3 a branching cell [1] is a subset of events closed under downward causality and immediate conflict relations. This means ...
Henri Hansen, Xu Wang
IJSN
2007
94views more  IJSN 2007»
13 years 5 months ago
On security proof of McCullagh?Barreto's key agreement protocol and its variants
: McCullagh and Barreto presented an identity-based authenticated key agreement protocol in CT-RSA 2005. Their protocol was found to be vulnerable to a key-compromise impersonation...
Zhaohui Cheng, Liqun Chen
CCS
2008
ACM
13 years 7 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung