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...
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...
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...
— 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 ...
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...