A New Signature Scheme Without Random Oracles from Bilinear Pairings | Zendy

Fangguo Zhang | Zendy; Xiaofeng Chen | Zendy; Willy Susilo | Zendy; Yi Mu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A New Signature Scheme Without Random Oracles from Bilinear Pairings

Author(s) -

Fangguo Zhang,

Xiaofeng Chen,

Willy Susilo,

Yi Mu

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-68799-8

DOI - 10.1007/11958239_5

Subject(s) - random oracle , signature (topology) , schnorr signature , scheme (mathematics) , oracle , bilinear interpolation , mathematics , theoretical computer science , construct (python library) , computer science , square (algebra) , merkle signature scheme , algorithm , digital signature , blind signature , public key cryptography , computer security , statistics , encryption , hash function , computer network , mathematical analysis , programming language , geometry

In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of the proposed scheme depends on a new complexity assumption called the k+1 square roots assumption. Moreover, the k+1 square roots assumption can be used to construct shorter signatures under the random oracle model.

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