TY - GEN
T1 - HBSS
T2 - 7th International Symposium on Cyber Security, Cryptology, and Machine Learning, CSCML 2023
AU - Dolev, Shlomi
AU - Yagudaev, Avraam
AU - Yung, Moti
N1 - Publisher Copyright: © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023/1/1
Y1 - 2023/1/1
N2 - One-time signatures (originated by Lamport) and their extensions to many signatures has gained recent momentum with the need for Post-Quantum secure signing since they are essentially based on standard hash (one-way) functions (rather than number theoretic assumptions). Such signatures, to date, have been based on an array of commitments that are de-committed (private key/preimage revealed) only based on bits of a representation of the hashed message signed, and their stateless versions have been based on pseudorandom functions. In this work, a new approach to the above is presented, based on probabilistic “set membership data structure,” which in turn is based on hash functions. A signature based on hash access to a suitably long array, where k hash functions which are independent are used for each message to tag an index in the array. The above access is similar to the access performed in Bloom filters. The resulting signature scheme is stateless and can be tuned to support any given upper-bound number of signatures (by tuning the array’s length). The central idea is that a de-committed array is only partially loaded with de-commitments to be valid, a fact that assures correctness (signed message is validated), soundness (unsigned message is not fully validated), and unforgeability of the signature (an attempt to forge a signature is reduced to decommitment without access to the private key/decommited preimage). Constructions that are based on enhancing a one-time or bounded-message construction (such as the Naor-Yung extension from bounded messages to regular signatures) are valid for the new Hash-Based Stateless Signature (HBSS).
AB - One-time signatures (originated by Lamport) and their extensions to many signatures has gained recent momentum with the need for Post-Quantum secure signing since they are essentially based on standard hash (one-way) functions (rather than number theoretic assumptions). Such signatures, to date, have been based on an array of commitments that are de-committed (private key/preimage revealed) only based on bits of a representation of the hashed message signed, and their stateless versions have been based on pseudorandom functions. In this work, a new approach to the above is presented, based on probabilistic “set membership data structure,” which in turn is based on hash functions. A signature based on hash access to a suitably long array, where k hash functions which are independent are used for each message to tag an index in the array. The above access is similar to the access performed in Bloom filters. The resulting signature scheme is stateless and can be tuned to support any given upper-bound number of signatures (by tuning the array’s length). The central idea is that a de-committed array is only partially loaded with de-commitments to be valid, a fact that assures correctness (signed message is validated), soundness (unsigned message is not fully validated), and unforgeability of the signature (an attempt to forge a signature is reduced to decommitment without access to the private key/decommited preimage). Constructions that are based on enhancing a one-time or bounded-message construction (such as the Naor-Yung extension from bounded messages to regular signatures) are valid for the new Hash-Based Stateless Signature (HBSS).
UR - http://www.scopus.com/inward/record.url?scp=85164969529&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-031-34671-2_27
DO - https://doi.org/10.1007/978-3-031-34671-2_27
M3 - Conference contribution
SN - 9783031346705
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 389
EP - 397
BT - Cyber Security, Cryptology, and Machine Learning - 7th International Symposium, CSCML 2023, Proceedings
A2 - Dolev, Shlomi
A2 - Gudes, Ehud
A2 - Paillier, Pascal
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 29 June 2023 through 30 June 2023
ER -