Sciweavers

35 search results - page 6 / 7
» Limiting trust in the storage stack
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 6 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
14 years 12 days ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
SACRYPT
2005
Springer
189views Cryptology» more  SACRYPT 2005»
13 years 11 months ago
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
David Molnar, Andrea Soppera, David Wagner
XPU
2007
Springer
14 years 2 days ago
Empirical Evidence Principle and Joint Engagement Practice to Introduce XP
Bringing software process change to an organisation is a real challenge. The authors have shown a sample attempt to carry out a process change and then reflected on its results and...
Lech Madeyski, Wojciech Biela
SIGMOD
2012
ACM
220views Database» more  SIGMOD 2012»
11 years 8 months ago
GUPT: privacy preserving data analysis made easy
It is often highly valuable for organizations to have their data analyzed by external agents. However, any program that computes on potentially sensitive data risks leaking inform...
Prashanth Mohan, Abhradeep Thakurta, Elaine Shi, D...