Sciweavers

102 search results - page 11 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
PKC
2007
Springer
124views Cryptology» more  PKC 2007»
15 years 3 months ago
Practical and Secure Solutions for Integer Comparison
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
Juan A. Garay, Berry Schoenmakers, José Vil...
WPES
2004
ACM
15 years 3 months ago
Off-the-record communication, or, why not to use PGP
Quite often on the Internet, cryptography is used to protect private, personal communications. However, most commonly, systems such as PGP are used, which use long-lived encryptio...
Nikita Borisov, Ian Goldberg, Eric A. Brewer
CSI
2008
113views more  CSI 2008»
14 years 9 months ago
A privacy aware and efficient security infrastructure for vehicular ad hoc networks
VANETs have the potential to dramatically increase road safety by giving drivers more time to react adequately to dangerous situations. To prevent abuse of VANETs, a security infra...
Klaus Plößl, Hannes Federrath
DSN
2002
IEEE
15 years 2 months ago
Secure Intrusion-tolerant Replication on the Internet
This paper describes a Secure INtrusion-Tolerant Replication Architecture1 (SINTRA) for coordination in asynchronous networks subject to Byzantine faults. SINTRA supplies a number...
Christian Cachin, Jonathan A. Poritz