Sciweavers

21 search results - page 3 / 5
» New notions of security: achieving universal composability w...
Sort
View
CRYPTO
2005
Springer
125views Cryptology» more  CRYPTO 2005»
14 years 2 months ago
Secure Computation Without Authentication
In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs. Such a computation must preserve certain security propertie...
Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pa...
CCS
2007
ACM
14 years 3 months ago
Split-ballot voting: everlasting privacy with distributed trust
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
Tal Moran, Moni Naor
CISC
2007
Springer
156views Cryptology» more  CISC 2007»
14 years 3 months ago
Deniable Authentication on the Internet
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
Shaoquan Jiang
CRYPTO
2003
Springer
95views Cryptology» more  CRYPTO 2003»
14 years 2 months ago
Plaintext Awareness via Key Registration
Abstract. In this paper, we reconsider the notion of plaintext awareness. We present a new model for plaintext-aware encryption that is both natural and useful. We achieve plaintex...
Jonathan Herzog, Moses Liskov, Silvio Micali
IANDC
2007
152views more  IANDC 2007»
13 years 9 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner