Sciweavers

524 search results - page 62 / 105
» On the Security of the DeKaRT Primitive
Sort
View
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
16 years 10 days ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
STORAGESS
2006
ACM
16 years 23 days ago
Scalable security for large, high performance storage systems
New designs for petabyte-scale storage systems are now capable of transferring hundreds of gigabytes of data per second, but lack strong security. We propose a scalable and effici...
Andrew W. Leung, Ethan L. Miller
PKC
2004
Springer
106views Cryptology» more  PKC 2004»
16 years 4 days ago
On the Security of Multiple Encryption or CCA-security+CCA-security=CCA-security?
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
Rui Zhang 0002, Goichiro Hanaoka, Junji Shikata, H...
FOCS
2005
IEEE
16 years 13 days ago
Cryptography In the Bounded Quantum-Storage Model
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
SIGOPSE
2004
ACM
16 years 7 days ago
AP3: cooperative, decentralized anonymous communication
This paper describes a cooperative overlay network that provides anonymous communication services for participating users. The Anonymizing Peer-to-Peer Proxy (AP3) system provides...
Alan Mislove, Gaurav Oberoi, Ansley Post, Charles ...