Hash-based cryptography: Difference between revisions

Revision as of 03:08, 11 October 2021

Revision as of 13:11, 11 October 2021

Line 1:

'''Hash-based cryptography''' is the generic term for constructions of [[cryptographic primitive]]s based on the security of [[hash function]]s. It is of interest as a type of [[post-quantum cryptography]].

So far, hash-based cryptography is used to construct [[digital signature]]s schemes such as the [[Merkle signature scheme]], zero knowledge and computationally integrity proofs, such as the the zk-STARK<ref name=bensasson2018> Scalable, transparent, and post-quantum secure computational integrity, Ben-Sasson, Eli and Bentov, Iddo and Horesh, Yinon and Riabzev, Michael, 2018

</ref> proof system and range proofs over issued credentials via the HashWires <ref name=kchalkias2021>{{cite journal|last1=Chalkias|first1=Konstantinos|last2=Cohen|first2=Shir|last3=Lewi|first3=Kevin|last4=Moezinia|first4=Fredric|last5=Romailler|first5=Yolan|title=HashWires: Hyperefficient Credential-Based Range Proofs|journal=Privacy Enhancing Technologies Symposium (PETS) 2021|year=2021}}</ref> protocol. Hash-based signature schemes combine a one-time signature scheme with a [[Merkle tree]] structure. Since a one-time signature scheme key can only sign a single message securely, it is practical to combine many such keys within a single, larger structure. A Merkle tree structure is used to this end. In this hierarchical data structure, a hash function and concatenation are used repeatedly to compute tree nodes. [[Lamport signature]]s are an example of a one-time signature scheme that can be combined with a Merkle tree structure.