Sciweavers

576 search results - page 3 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 29 days ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
PKC
2010
Springer
119views Cryptology» more  PKC 2010»
13 years 8 months ago
Efficient Set Operations in the Presence of Malicious Adversaries
We revisit the problem of constructing efficient secure two-party protocols for the problems of setintersection and set-union, focusing on the model of malicious parties. Our main...
Carmit Hazay, Kobbi Nissim
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
14 years 6 months ago
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
A key exchange protocol allows a set of parties to agree upon a secret session key over a public network. Two-party key exchange (2PKE) protocols have been rigorously analyzed unde...
Colin Boyd, Juan Manuel González Nieto, M. ...
SCN
2008
Springer
142views Communications» more  SCN 2008»
13 years 6 months ago
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
Yehuda Lindell, Benny Pinkas, Nigel P. Smart
EUROCRYPT
2007
Springer
13 years 10 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas