TY - GEN
T1 - History Binding Signature
T2 - 5th International Symposium on Cyber Security Cryptography and Machine Learning, CSCML 2021
AU - Dolev, Shlomi
AU - Liber, Matan
N1 - Funding Information:
This work is supported by the Lynne and William Frankel Center for Computer Science, and is partially supported by the Rita Altura Trust Chair in Computer Science, a grant from the Ministry of Science and Technology, Israel & the Japan Science and Technology Agency (JST), and the German Research Funding (DFG, Grant#8767581199).
Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/7/1
Y1 - 2021/7/1
N2 - Digital signatures are used to verify the authenticity of digital messages, that is, to know with a high level of certainty, that a digital message was created by a known sender and was not altered in any way. This is usually achieved by using asymmetric cryptography, where a secret key is used by the signer, and the corresponding public key is used by those who wish to verify the signed data. In many use-cases, such as blockchain, the history and order of the signed data, thus the signatures themselves, are important. In blockchains specifically, the threat is forks, where one can double-spend its crypto-currency if one succeeds to publish two valid transactions on two different branches of the chain. We introduce a single private/public key pair signature scheme using verifiable random function, that binds a signer to its signature history. The scheme enforces a single ordered signatures’ history using a deterministic verifiable chain of signature functions that also reveals the secret key in case of misbehaviors.
AB - Digital signatures are used to verify the authenticity of digital messages, that is, to know with a high level of certainty, that a digital message was created by a known sender and was not altered in any way. This is usually achieved by using asymmetric cryptography, where a secret key is used by the signer, and the corresponding public key is used by those who wish to verify the signed data. In many use-cases, such as blockchain, the history and order of the signed data, thus the signatures themselves, are important. In blockchains specifically, the threat is forks, where one can double-spend its crypto-currency if one succeeds to publish two valid transactions on two different branches of the chain. We introduce a single private/public key pair signature scheme using verifiable random function, that binds a signer to its signature history. The scheme enforces a single ordered signatures’ history using a deterministic verifiable chain of signature functions that also reveals the secret key in case of misbehaviors.
KW - Digital signature
KW - Verifiable random function
KW - Verifiable secret sharing
UR - https://www.scopus.com/pages/publications/85111995406
U2 - 10.1007/978-3-030-78086-9_17
DO - 10.1007/978-3-030-78086-9_17
M3 - Conference contribution
AN - SCOPUS:85111995406
SN - 9783030780852
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 221
EP - 229
BT - Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings
A2 - Dolev, Shlomi
A2 - Margalit, Oded
A2 - Pinkas, Benny
A2 - Schwarzmann, Alexander
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 8 July 2021 through 9 July 2021
ER -