Sciweavers

2601 search results - page 520 / 521
» Secure Rewarding Schemes
Sort
View
USS
2010
13 years 4 months ago
P4P: Practical Large-Scale Privacy-Preserving Distributed Computation Robust against Malicious Users
In this paper we introduce a framework for privacypreserving distributed computation that is practical for many real-world applications. The framework is called Peers for Privacy ...
Yitao Duan, NetEase Youdao, John Canny, Justin Z. ...
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 1 months ago
Quire: Lightweight Provenance for Smart Phone Operating Systems
Smartphone apps often run with full privileges to access the network and sensitive local resources, making it difficult for remote systems to have any trust in the provenance of ...
Michael Dietz, Shashi Shekhar, Yuliy Pisetsky, Anh...
IWQOS
2011
Springer
12 years 9 months ago
Adaptive data-driven service integrity attestation for multi-tenant cloud systems
Abstract—Cloud systems provide a cost-effective service hosting infrastructure for application service providers (ASPs). However, cloud systems are often shared by multiple tenan...
Juan Du, Xiaohui Gu, Nidhi Shah
ASIACRYPT
2011
Springer
12 years 6 months ago
The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
Divesh Aggarwal, Ueli Maurer
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
11 years 8 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart