Sciweavers

570 search results - page 50 / 114
» Black-box constructions for secure computation
Sort
View
OOPSLA
1999
Springer
15 years 10 months ago
Object Views: Language Support for Intelligent Object Caching in Parallel and Distributed Computations
Object-based parallel and distributed applications are becoming increasingly popular, driven by the programmability advantages of component technology and a flat shared-object spa...
Ilya Lipkind, Igor Pechtchanski, Vijay Karamcheti
IACR
2011
147views more  IACR 2011»
14 years 5 months ago
Adaptive Security of Concurrent Non-Malleable Zero-Knowledge
A zero-knowledge protocol allows a prover to convince a verifier of the correctness of a statement without disclosing any other information to the verifier. It is a basic tool a...
Zhenfu Cao, Zongyang Zhang, Yunlei Zhao
CCS
2010
ACM
15 years 5 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
CANS
2008
Springer
86views Cryptology» more  CANS 2008»
15 years 7 months ago
Chosen-Ciphertext Secure Proxy Re-encryption without Pairings
Proxy re-encryption (PRE), introduced by Blaze, Bleumer and Strauss, allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into an encryption of the sa...
Robert H. Deng, Jian Weng, Shengli Liu, Kefei Chen
FOCS
2007
IEEE
16 years 17 hour ago
Lower Bounds on Signatures From Symmetric Primitives
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
Boaz Barak, Mohammad Mahmoody-Ghidary