z-logo
open-access-imgOpen Access
An Introduction to Multi-trapdoor Hash Functions and It's Applications
Author(s) -
Mukesh Singhal
Publication year - 2015
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2015.08.397
Subject(s) - computer science , hash function , cryptographic hash function , scalability , hash chain , theoretical computer science , cryptography , cryptographic primitive , signature (topology) , sha 2 , distributed computing , computer security , cryptographic protocol , database , mathematics , geometry
Trapdoor hash function is a highly useful cryptographic primitive for building a wide variety of novel signature schemes, like chameleon, online-offline, threshold, proxy, sanitizable and amortized signatures. These signature schemes form an essential part of the collection of mechanisms used for securing today's computing systems. With the advent of large-scale computing systems, like clouds, the need for building signature schemes that are both efficient and scalable has become increasingly important. This talk will discuss a cryptographic primitive, called a multi-trapdoor hash function, that is designed to address this need. The proposed hash function allows multiple entities to compute a collision with a given hash value. Using this unique property of multi-trapdoor hash functions, this talk will also present a preliminary design of aggregate signature and its application in securing clouds

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom