Sciweavers

172 search results - page 26 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 8 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
CRYPTO
2008
Springer
132views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Public-Key Locally-Decodable Codes
In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Code (PKLDC). In particular, we allow any polynomialtime ...
Brett Hemenway, Rafail Ostrovsky
AMW
2010
13 years 9 months ago
Certification and Authentication of Data Structures
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
Roberto Tamassia, Nikos Triandopoulos
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
14 years 8 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
OOPSLA
1999
Springer
14 years 4 days 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