A Characterization of Chameleon Hash Functions and New, Efficient Designs

2013 ◽  
Vol 27 (4) ◽  
pp. 799-823 ◽  
Author(s):  
Mihir Bellare ◽  
Todor Ristov
Keyword(s):  
Hash Functions ◽  
Chameleon Hash

Efficient chameleon hash functions in the enhanced collision resistant model

2020 ◽  
Vol 510 ◽  
pp. 155-164 ◽  
Author(s):  
Mojtaba Khalili ◽  
Mohammad Dakhilalian ◽  
Willy Susilo
Keyword(s):  
Hash Functions ◽  
Chameleon Hash

scholarly journals Tightly-Secure Signatures from Chameleon Hash Functions

2015 ◽  
pp. 256-279 ◽  
Author(s):  
Olivier Blazy ◽  
Saqib A. Kakvi ◽  
Eike Kiltz ◽  
Jiaxin Pan
Keyword(s):  
Hash Functions ◽  
Chameleon Hash

Chameleon Hash Functions and One-Time Signature Schemes from Inner Automorphism Groups

2013 ◽  
Vol 126 (1) ◽  
pp. 103-119 ◽  
Author(s):  
Ping Pan ◽  
Licheng Wang ◽  
Yixian Yang ◽  
Yuanju Gan ◽  
Lihua Wang ◽  
...  
Keyword(s):  
Automorphism Groups ◽  
Hash Functions ◽  
Signature Schemes ◽  
Inner Automorphism ◽  
Time Signature ◽  
Chameleon Hash

scholarly journals Homomorphic Signatures from Chameleon Hash Functions

2017 ◽  
Vol 46 (2) ◽  
Author(s):  
Dong Xie ◽  
Haipeng Peng ◽  
Lixiang Li ◽  
Yixian Yang
Keyword(s):  
Hash Functions ◽  
Homomorphic Signatures ◽  
Chameleon Hash

Probably Secure Efficient Anonymous Credential Scheme

2018 ◽  
Vol 6 (3) ◽  
pp. 18-35 ◽  
Author(s):  
Chien-Nan Wu ◽  
Chun-I Fan ◽  
Jheng-Jia Huang ◽  
Yi-Fan Tseng ◽  
Hiroaki Kikuchi
Keyword(s):  
Computational Cost ◽  
Hash Functions ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Cost Comparison ◽  
Signature Scheme ◽  
Zero Knowledge ◽  
Comparison Table ◽  
Anonymous Credential ◽  
Chameleon Hash

This article describes how after the concept of anonymous credential systems was introduced in 1985, a number of similar systems have been proposed. However, these systems use zero-knowledge protocols to authenticate users, resulting in inefficient authentication during the stage of proving credential possession. To overcome this drawback, this article presents a signature scheme that uses partially blind signatures and chameleon hash functions such that both the prover and verifier achieve efficient authentication. In addition to providing a computational cost comparison table showing that the proposed signature scheme achieves a more efficient credential possession proving compared to other schemes, concrete security proofs are provided under a random oracle model to demonstrate that the proposed scheme satisfies the properties of anonymous credentials.

Sign in / Sign up

Export Citation Format

Share Document