13 Hits in 6.6 sec

Leighton-Micali Hash-Based Signatures in the Quantum Random-Oracle Model [chapter]

Edward Eaton
2017 Lecture Notes in Computer Science  
In this work we close this gap by showing a proof of the security of LMS in the quantum random-oracle model.  ...  This means that hash-based signatures are strong candidates for standard use in a post-quantum world.  ...  The Quantum Random-Oracle Model Katz's classical proof of the security of LMS takes place in the random-oracle model.  ... 
doi:10.1007/978-3-319-72565-9_13 fatcat:qldhpv42frchdiuyntpgekwu5i

SPHINCS-α: A Compact Stateless Hash-Based Signature Scheme [article]

Kaiyi Zhang, Hongrui Cui, Yu Yu
2022 IACR Cryptology ePrint Archive  
Hash-based signatures offer a conservative alternative to post-quantum signatures with arguably better-understood security than other post-quantum candidates.  ...  In this paper, we introduce SPHINCS-α, a stateless hash-based signature scheme, which benefits from a twofold improvement.  ...  A straightforward instantiation of the tweakable hash function in the QROM can be simply Th(P, T, M ) = H(P ||T ||M ) , where the hash function H is assumed to behave like a quantum accessible random oracle  ... 
dblp:journals/iacr/ZhangCY22 fatcat:sjneny7f5rau3newbiy44522i4

Hash-based signature revisited

Lingyun Li, Xianhui Lu, Kunpeng Wang
2022 Cybersecurity  
As one of the mainstreams of post quantum cryptography primitives, hash-based signature has attracted more and more concern in both cryptographic research and application in recent years.  ...  Firstly, this paper discusses the research progress in the component of hash-based signature, i.e., one-time signature and few-time signature; then classifies the tree-based public key authentication schemes  ...  The iteration functions of OTS and hash tree both need to be second preimage resistant. The literature (Eaton 2017) gives the security reduction of LMS in quantum random oracle model.  ... 
doi:10.1186/s42400-022-00117-w fatcat:ssugdb7crnhmfhdqct55td45du

On the security of the WOTS-PRF signature scheme

Philip Lafrance, Alfred Menezes
2019 Advances in Mathematics of Communications  
We identify a flaw in the security proof and a flaw in the concrete security analysis of the WOTS-PRF variant of the Winternitz one-time signature scheme, and discuss the implications to its concrete security  ...  The Leighton and Micali scheme WOTS-LM is described in an IETF Internet-Draft [21] , and has been analyzed in the random oracle model [17] and the quantum random oracle model [7] . Buchmann et al.  ...  Another hash-based WOTS variant, called WOTS + , was proposed by Hülsing [12] and has been included in an IETF standard [14] .  ... 
doi:10.3934/amc.2019012 fatcat:5kktf2ikkvgqdecusiupnc7i3m

High Performance of Hash-based Signature Schemes

Ana Karina, Julio L´opez, Roberto Cabral
2017 International Journal of Advanced Computer Science and Applications  
In this work, we present a software implementation of two recent standard proposals for hash-based signature schemes, Leighton and Micali Signature (LMS) scheme and Extended Merkle Signature Scheme (XMSS  ...  Hash-based signature schemes, whose security is based on properties of the underlying hash functions, are promising candidates to be quantum-safe digital signatures schemes.  ...  ACKNOWLEDGMENT The authors would like to thank the anonymous referees for their valuable comments and suggestions to improve the quality of this paper.  ... 
doi:10.14569/ijacsa.2017.080358 fatcat:olr5ttfanvebdm27ezhkemznmu

State Management for Hash-Based Signatures [chapter]

David McGrew, Panos Kampanakis, Scott Fluhrer, Stefan-Lukas Gazdag, Denis Butin, Johannes Buchmann
2016 Lecture Notes in Computer Science  
In this paper, we analyze state management in N -time hash-based signature schemes, considering both security and performance, and categorize the security issues that can occur due to state synchronization  ...  Hash-based signatures are well-understood and promising candidates, and the object of current standardization efforts.  ...  (i − 1) th level private key, and the signature [15] , a scheme by Leighton and Micali [20] and SPHINCS [1] .  ... 
doi:10.1007/978-3-319-49100-4_11 fatcat:qq54nyxr7naelmq2xdxhzwyica

Post-Quantum Cryptography [chapter]

Qijun Gu, Pascal Paillier, Tanja Lange, Edlyn Teske, Darrel Hankerson, Alfred Menezes, David Zhang, Feng Yue, Wangmeng Zuo, Jean-Jacques Quisquater, Gildas Avoine, Gerald Brose (+73 others)
2011 Encyclopedia of Cryptography and Security  
The first editor would like to additionally thank Tanja Lange for many illuminating discussions regarding post-quantum cryptography and for initiating the Post-Quantum Cryptography workshop series in the  ...  We hope that it serves as an introduction to the field, as an overview of the state of the art, and as an encouragement for many more scientists to join us in investigating post-quantum cryptography.  ...  Acknowledgements We thank Phong Nguyen and Markus Rückert for helpful discussions on the practical security of lattice-based cryptography.  ... 
doi:10.1007/978-1-4419-5906-5_386 fatcat:ucdkilta7zc3voq7nqctmjkcr4

On randomization in sequential and distributed algorithms

Rajiv Gupta, Scott A. Smolka, Shaji Bhaskar
1994 ACM Computing Surveys  
), universal hashing (choosing the hash function dynamically and at random), irzteractwe probabdwtLc proof systems (a new method of program testing), dining philosophers (a classical problem in distributed  ...  This survey presents five techniques that have been widely used in the design of randomized algorithms.  ...  As we will see, the problem of universal hashing (?7niuHash) also admits a solution based on control randomization. Random Sampling.  ... 
doi:10.1145/174666.174667 fatcat:mwufckvt5vawlostdlhcv7rxwm


Ivan Homoliak, Dominik Breitenbacher, Ondrej Hujnak, Pieter Hartel, Alexander Binder, Pawel Szalachowski
2020 Proceedings of the 2nd ACM Conference on Advances in Financial Technologies  
We have made a proof-of-concept based on the Ethereum platform.  ...  In SmartOTPs, the OTPs are aggregated by a Merkle tree and hash chains whereby for each authentication only a short OTP (e.g., 16B-long) is transferred from the authenticator to the client.  ...  ACKNOWLEDGMENT This work was supported by the IT4Innovations Excellence in Science project LQ1602, H2020 ECSEL project VALU3S (876852), and the internal project of Brno University of Technology (FIT-S-  ... 
doi:10.1145/3419614.3423257 dblp:conf/aft/HomoliakBHHBS20 fatcat:2zifsl5kwvdnhdiuszp3d36awq

SmartOTPs: An Air-Gapped 2-Factor Authentication for Smart-Contract Wallets [article]

Ivan Homoliak, Dominik Breitenbacher, Ondrej Hujnak, Pieter Hartel, Alexander Binder, Pawel Szalachowski
2020 arXiv   pre-print
We have made a proof-of-concept based on the Ethereum platform.  ...  In SmartOTPs, the OTPs are aggregated by a Merkle tree and hash chains whereby for each authentication only a short OTP (e.g., 16B-long) is transferred from the authenticator to the client.  ...  To harden a hash chain against a birthday attack, a domain separation proposed by Leighton and Micali [58] can be used: a different hash function is applied in each step of a hash chain.  ... 
arXiv:1812.03598v4 fatcat:ss53iwh7qbcmvaqzgnsiqcgcey

Cryptography (Dagstuhl Seminar 02391)

Ueli Maurer, Adi Shamir, Jacques Stern, Moti Yung
The applicability of various proof methodologies (random oracle proofs, generic model) to validation of cryptographic constructions. 5.  ...  Novel cryptographic applications based on the bilinearity of pairings. 4.  ...  We show that any scheme secure in the random oracle model is also secure in the random oracle model, and conversely.  ... 
doi:10.4230/dagsemrep.355 fatcat:lc6ttm2g3vh5xk2pbfffhxgmxy

On the State of Post-Quantum Cryptography Migration

Nouri Alnahawi, Alexander Wiesmaier, Tobias Grasmeyer, Julian Geißler, Alexander Zeier, Pia Bauspieß, Andreas Heinemann
Safeguarding current and future IT security from quantum computers implies more than the mere development of Post-Quantum Cryptography (PQC) algorithms.  ...  We use our findings as starting point to initiate an open community project in the form of a website to keep track of the ongoing efforts and the state of the art in PQC research.  ...  Acknowledgment: This research work has been funded by the German Federal Ministry of Education and Research and the Hessian Ministry of Higher Education, Research, Science and the Arts within their joint  ... 
doi:10.18420/informatik2021-078 fatcat:fh3ahtuyvresrjjdbzw7pc527i

Subject Index to Volumes 1–75

2001 Information Processing Letters  
, 1095 Leighton and Micali, 2991 protocol, 2991 Leighton and Rao balanced separator procedure, 2820 Leighton et al., 2416 Leiserson systolic model, 1445 Leiss, 1249, 2466 Lempel, 562 Lempel, Seroussi  ...  address, 1112, 1142 addresses, 2127 addressing, 1736 area, 177 based, 1804 hash based join, 3151 algorithm, 1730 hash based method, 2041 buckets, 1037 hash coding, 212, 265, 1142 method, 222  ...  ., 3150, 3816 Ranjan, Desh, 3790 rank, 252, 623, 694, 1269 , 1610 , 1869 , 1924 , 2224 , 2596 , 2825 , 3641 decision problem, 694 rank of a matrix, 3196 order n matrices, 623 tensors, 719 the adjacency  ... 
doi:10.1016/s0020-0190(01)00175-2 fatcat:5y67tfm6yfbblakrus5nnhs73e