Sciweavers

page 59768 / 60054
» publications
Sort
View
ARESEC
2011
117views more  ARESEC 2011»
14 years 6 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
ASAP
2011
IEEE
233views Hardware» more  ASAP 2011»
14 years 6 months ago
Accelerating vision and navigation applications on a customizable platform
—The domain of vision and navigation often includes applications for feature tracking as well as simultaneous localization and mapping (SLAM). As these problems require computati...
Jason Cong, Beayna Grigorian, Glenn Reinman, Marco...
ASIACRYPT
2011
Springer
14 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
ASIACRYPT
2011
Springer
14 years 6 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
ASIACRYPT
2011
Springer
14 years 6 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
« Prev « First page 59768 / 60054 Last » Next »