Open AccessSequential Aggregate Signatures and Multisignatures in the Plain Public Key Model
Author(s) -
Zhou Xuhua,
Lai Junzuo,
Liu Shengli,
Chen Kefei
Publication year - 2015
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2015.04.019
Subject(s) - key (lock) , aggregate (composite) , computer science , scheme (mathematics) , public key cryptography , signature (topology) , random oracle , computer security , computer security model , theoretical computer science , mathematics , encryption , mathematical analysis , materials science , geometry , composite material
At Eurocrypt’06, Lu et al. presented the first Sequential aggregate signature (SAS) provably secure without random oracles. The draw back of their scheme is that users need long public keys and the security model makes the Knowledge of secure key (KOSK) assumption. We present the first SAS scheme, which the user needs short public keys and the security is proven without random oracles, in the plain public key model. We also present the first Multisignature (MS) scheme in the plain public key model, which the security is proven without random oracles.