Reinforced Concrete: A Fast Hash Function for Verifiable Computation

  • Lorenzo Grassi
  • , Dmitry Khovratovich
  • , Reinhard Lüftenegger
  • , Christian Rechberger
  • , Markus Schofnegger
  • , Roman Walch

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

40 Citations (Scopus)

Abstract

We propose a new hash function Reinforced Concrete, which is the first generic purpose hash that is fast both for a zero-knowledge prover and in native x86 computations. It is suitable for a various range of zero-knowledge proofs and protocols, from set membership to generic purpose verifiable computation. Being up to 15x faster than its predecessor Poseidon hash, Reinforced Concrete inherits security from traditional time-tested schemes such as AES, whereas taking the zero-knowledge performance from a novel and efficient decomposition of a prime field into compact buckets.
The new hash function is suitable for a wide range of applications like privacy-preserving cryptocurrencies, verifiable encryption, protocols with state membership proofs, or verifiable computation. It may serve as a drop-in replacement for various prime-field hashes such as variants of MiMC, Poseidon, Pedersen hash, and others.
Original languageEnglish
Title of host publicationCCS '22
Subtitle of host publicationProceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc.
Pages1323-1335
Number of pages13
ISBN (Electronic)978-1-4503-9450-5
DOIs
Publication statusPublished - 7 Nov 2022
Externally publishedYes

Fingerprint

Dive into the research topics of 'Reinforced Concrete: A Fast Hash Function for Verifiable Computation'. Together they form a unique fingerprint.

Cite this