Sciweavers

1064 search results - page 110 / 213
» Cryptography from Anonymity
Sort
View
WCNC
2008
IEEE
15 years 10 months ago
A Secure Routing Protocol in Proactive Security Approach for Mobile Ad-Hoc Networks
—Secure routing of Mobile Ad-hoc Networks (MANETs) is still a hard problem after years of research. We therefore propose to design a secure routing protocol in a new approach. Th...
Shushan Zhao, Akshai K. Aggarwal, Shuping Liu, Hua...
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
15 years 9 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya
CRYPTO
2003
Springer
109views Cryptology» more  CRYPTO 2003»
15 years 9 months ago
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...
Omer Horvitz, Virgil D. Gligor
137
Voted
EUROCRYPT
2003
Springer
15 years 9 months ago
CAPTCHA: Using Hard AI Problems for Security
We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an u...
Luis von Ahn, Manuel Blum, Nicholas J. Hopper, Joh...
FSE
2003
Springer
134views Cryptology» more  FSE 2003»
15 years 9 months ago
A New Class of Collision Attacks and Its Application to DES
Until now in cryptography the term collision was mainly associated with the surjective mapping of different inputs to an equal output of a hash function. Previous collision attack...
Kai Schramm, Thomas J. Wollinger, Christof Paar