Sciweavers

658 search results - page 79 / 132
» The Grindahl Hash Functions
Sort
View
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
15 years 10 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
ICC
2007
IEEE
105views Communications» more  ICC 2007»
15 years 4 months ago
Wheel of Trust: A Secure Framework for Overlay-Based Services
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...
Guor-Huar Lu, Zhi-Li Zhang
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
15 years 3 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
ITCC
2005
IEEE
15 years 3 months ago
A Proposal of Short Proxy Signature using Pairing
— In this paper, we propose a new pairing-based proxy signature. Most remarkable point in our proposal is that our scheme realizes short signature. More concretely, the explicit ...
Takeshi Okamoto, Atsuo Inomata, Eiji Okamoto
KES
2005
Springer
15 years 3 months ago
Watermarking Protocol Compatible with Secret Algorithms for Resisting Invertibility Attack
Abstract. Invertibility attack is a hostile measure to breach watermarking systems. In this paper, a novel watermarking protocol using a one-way hash function and a check of random...
Xinpeng Zhang, Shuozhong Wang