Sciweavers

1064 search results - page 76 / 213
» Cryptography from Anonymity
Sort
View
PET
2010
Springer
14 years 1 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
CSFW
2009
IEEE
14 years 4 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
ACNS
2008
Springer
115views Cryptology» more  ACNS 2008»
14 years 4 months ago
The Security of EPC Gen2 Compliant RFID Protocols
The increased functionality of EPC Class1 Gen2 (EPCGen2) is making this standard the de facto specification for inexpensive tags in the RFID industry. EPCGen2 supports only very b...
Mike Burmester, Breno de Medeiros
ACNS
2006
Springer
78views Cryptology» more  ACNS 2006»
14 years 3 months ago
DSO: Dependable Signing Overlay
Dependable digital signing service requires both high fault-tolerance and high intrusion-tolerance. While providing high fault-tolerance, existing approaches do not satisfy the hig...
Guofei Gu, Prahlad Fogla, Wenke Lee, Douglas M. Bl...
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
14 years 3 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert