Sciweavers

5476 search results - page 67 / 1096
» Resettably Secure Computation
Sort
View
121
Voted
ESOP
2005
Springer
15 years 9 months ago
Computationally Sound, Automated Proofs for Security Protocols
Since the 1980s, two approaches have been developed for analyzing security protocols. One of the approaches relies on a computational model that considers issues of complexity and ...
Véronique Cortier, Bogdan Warinschi
111
Voted
FOSSACS
2005
Springer
15 years 9 months ago
Bridging Language-Based and Process Calculi Security
Language-based and process calculi-based information security are well developed fields of computer security. Although these fields have much in common, it is somewhat surprising...
Riccardo Focardi, Sabina Rossi, Andrei Sabelfeld
135
Voted
ASIACRYPT
2009
Springer
15 years 10 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...
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 8 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...
121
Voted
AINA
2005
IEEE
15 years 9 months ago
A Practical Modelling Notation for Secure Distributed Computation
Mobile code computation has lead to a new paradigm of distributed computation. A mobile process can move from site to site and interact with the resources as a local process. To p...
Yih-Jiun Lee, Peter Henderson