Sciweavers

1562 search results - page 81 / 313
» Mathematics, Cryptology, Security
Sort
View
CRYPTO
2000
Springer
128views Cryptology» more  CRYPTO 2000»
14 years 15 days ago
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
We investigate the all-or-nothing encryption paradigm which was introduced by Rivest as a new mode of operation for block ciphers. The paradigm involves composing an all-or-nothing...
Anand Desai
EUROCRYPT
1999
Springer
14 years 13 days ago
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...
Yongge Wang, Yvo Desmedt
PKC
1998
Springer
107views Cryptology» more  PKC 1998»
14 years 11 days ago
On the Security of ElGamal Based Encryption
The ElGamal encryption scheme has been proposed several years ago and is one of the few probabilistic encryption schemes. However, its security has never been concretely proven bas...
Yiannis Tsiounis, Moti Yung
FC
2010
Springer
141views Cryptology» more  FC 2010»
14 years 2 days ago
When Information Improves Information Security
We investigate a mixed economy of an individual rational expert and several na¨ıve near-sighted agents in the context of security decision making. Agents select between three ca...
Jens Grossklags, Benjamin Johnson, Nicolas Christi...
EUROCRYPT
2007
Springer
14 years 1 days ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo