Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
ASIACRYPT
2008
Springer
11 years 7 months ago
MPC vs. SFE : Unconditional and Computational Security
Abstract. In secure computation among a set P of players one considers an adversary who can corrupt certain players. The three usually considered types of corruption are active, pa...
Martin Hirt, Ueli M. Maurer, Vassilis Zikas
ASIACRYPT
2008
Springer
11 years 7 months ago
Hash Functions from Sigma Protocols and Improvements to VSH
Mihir Bellare, Todor Ristov
ASIACRYPT
2008
Springer
11 years 7 months ago
Towards Robust Computation on Encrypted Data
Encryption schemes that support computation on encrypted data are useful in constructing efficient and intuitively simple cryptographic protocols. However, the approach was previo...
Manoj Prabhakaran, Mike Rosulek
ASIACRYPT
2008
Springer
11 years 7 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa
ASIACRYPT
2008
Springer
11 years 7 months ago
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
In this paper, we show that two variants of Stern's identification scheme [IEEE Transaction on Information Theory '96] are provably secure against concurrent attack unde...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa
ASIACRYPT
2008
Springer
11 years 7 months ago
Limits of Constructive Security Proofs
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
Michael Backes, Dominique Unruh
ASIACRYPT
2008
Springer
11 years 7 months ago
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
ASIACRYPT
2008
Springer
11 years 7 months ago
Universally Composable Adaptive Oblivious Transfer
In an oblivious transfer (OT) protocol, a Sender with messages M1, . . . , MN and a Receiver with indices 1, . . . , k [1, N] interact in such a way that at the end the Receiver ...
Matthew Green, Susan Hohenberger
ASIACRYPT
2008
Springer
11 years 7 months ago
A Modular Security Analysis of the TLS Handshake Protocol
We study the security of the widely deployed Secure Session Layer/Transport Layer Security (TLS) key agreement protocol. Our analysis identifies, justifies, and exploits the modul...
Paul Morrissey, Nigel P. Smart, Bogdan Warinschi
ASIACRYPT
2008
Springer
11 years 7 months ago
Generalized Identity Based and Broadcast Encryption Schemes
Abstract. We provide a general framework for constructing identitybased and broadcast encryption systems. In particular, we construct a general encryption system called spatial enc...
Dan Boneh, Michael Hamburg
books