Sciweavers

24188 search results - page 148 / 4838
» Computing on Encrypted Data
Sort
View
CCS
2008
ACM
15 years 5 months ago
Efficient attributes for anonymous credentials
We extend the Camenisch-Lysyanskaya anonymous credential system such that selective disclosure of attributes becomes highly efficient. The resulting system significantly improves ...
Jan Camenisch, Thomas Groß
ICPPW
2003
IEEE
15 years 8 months ago
Perfect Secrecy in Wireless Networks
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The ...
Phillip G. Bradford, Olga V. Gavrylyako, Randy K. ...
SISW
2005
IEEE
15 years 8 months ago
File System Design with Assured Delete
This paper describes a system that supports high availability of data, until the data should be expunged, at which time it is impossible to recover the data. This design supports ...
Radia J. Perlman
CCS
2007
ACM
15 years 9 months ago
How much anonymity does network latency leak?
Low-latency anonymity systems such as Tor, AN.ON, Crowds, and Anonymizer.com aim to provide anonymous connections that are both untraceable by “local” adversaries who control ...
Nicholas Hopper, Eugene Y. Vasserman, Eric Chan-Ti...
WPES
2006
ACM
15 years 9 months ago
Nonesuch: a mix network with sender unobservability
Oblivious submission to anonymity systems is a process by which a message may be submitted in such a way that neither the anonymity network nor a global passive adversary may dete...
Thomas S. Heydt-Benjamin, Andrei Serjantov, Beness...