Sciweavers

87 search results - page 17 / 18
» A Verifiable Random Function with Short Proofs and Keys
Sort
View
WPES
2005
ACM
15 years 3 months ago
Privacy for RFID through trusted computing
Radio Frequency Identification (RFID) technology raises significant privacy issues because it enables tracking of items and people possibly without their knowledge or consent. O...
David Molnar, Andrea Soppera, David Wagner
TOPLAS
2008
81views more  TOPLAS 2008»
14 years 9 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
15 years 7 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
CSFW
2002
IEEE
15 years 2 months ago
Security Protocol Design via Authentication Tests
We describe a protocol design process, and illustrate its use by creating ATSPECT, an Authentication Test-based Secure Protocol for Electronic Commerce Transactions. The design pr...
Joshua D. Guttman
EUROCRYPT
2004
Springer
15 years 3 months ago
Positive Results and Techniques for Obfuscation
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
Ben Lynn, Manoj Prabhakaran, Amit Sahai