22 search results - page 3 / 5 » A Universally Composable Secure Channel Based on the KEM-DEM... |
CRYPTO
2006
Springer
14 years 6 days ago
2006
Springer
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
PODC
2010
ACM
14 years 12 days ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
CRYPTO
2005
Springer
14 years 2 months ago
2005
Springer
Anonymous channels are necessary for a multitude of privacy-protecting protocols. Onion routing is probably the best known way to achieve anonymity in practice. However, the crypto...
TCC
2005
Springer
14 years 2 months ago
2005
Springer
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
CARDIS
2008
Springer
13 years 10 months ago
2008
Springer
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...