Sciweavers

637 search results - page 68 / 128
» The Case for Abstracting Security Policies
Sort
View
EUROCRYPT
1998
Springer
15 years 11 months ago
Quorum-Based Secure Multi-party Computation
Abstract. This paper describes e cient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to...
Donald Beaver, Avishai Wool
ASIACRYPT
2009
Springer
16 years 1 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
WIMOB
2008
IEEE
16 years 1 months ago
Random Beacon for Privacy and Group Security
Abstract—Most contemporary security mechanisms and protocols include exchange of random or time-variant nonces as an essential means of protection against replay and other threat...
Aleksi Saarela, Jan-Erik Ekberg, Kaisa Nyberg
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
IEEESP
2010
99views more  IEEESP 2010»
15 years 5 months ago
The Iterated Weakest Link
Abstract. We devise a model for security investment that reflects dynamic interaction between a defender, who faces uncertainty, and an attacker, who repeatedly targets the weakes...
Rainer Böhme, Tyler Moore