Sciweavers

713 search results - page 90 / 143
» Dispersing Hash Functions
Sort
View
PKC
1999
Springer
102views Cryptology» more  PKC 1999»
15 years 2 months ago
How to Enhance the Security of Public-Key Encryption at Minimum Cost
This paper presents a simple and efficient conversion from a semantically secure public-key encryption scheme against passive adversaries to a non-malleable (or semantically secure...
Eiichiro Fujisaki, Tatsuaki Okamoto
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
15 years 1 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
CONEXT
2008
ACM
14 years 11 months ago
ALPHA: an adaptive and lightweight protocol for hop-by-hop authentication
Wireless multi-hop networks are particularly susceptible to attacks based on flooding and the interception, tampering with, and forging of packets. Thus, reliable communication in...
Tobias Heer, Stefan Götz, Oscar García...
ICWN
2008
14 years 11 months ago
A Framework of Authentic Post-Issuance Program Modification for Multi-Application Smart Cards
Authentic program modification is very important for a multi-application smart card system since applications in the system are realized after the issuance of the smart card. In t...
Mohammad Mesbah Uddin, Salahuddin Muhammad Salim Z...
CRYPTO
2008
Springer
92views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
Compression from Collisions, or Why CRHF Combiners Have a Long Output
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
Krzysztof Pietrzak