Skip to search formSkip to main contentSkip to account menu

Fiat–Shamir heuristic

Known as: Fiat-Shamir heuristic 
The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We are interested in investigating the following issue which rises during the implementation of signature schemes derived from… 
2016
2016
On the security of Fiat-Shamir (FS) type signatures, some negative circumstantial evidences were given in the non-programmable… 
2014
2014
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity… 
2013
2013
In this document, we formally analyze security in electronic voting and electronic auctions. On-line voting over is now available… 
2012
2012
Digital signature is one of the basic primitives in cryptography. A common paradigm of obtaining signatures, known as the Fiat… 
2012
2012
Digital signature is one of the basic primitives in cryptography. A common paradigm of obtaining signatures, known as the Fiat… 
2011
2011
In Mobile IPv6(MIPv6), a Mobile Node(MN) communicating with the Correspondent Node(CN) cannot prove the ownership of the claimed… 
2010
2010
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of… 
2007
2007
Since 1985 and their introduction by Goldwasser, Micali and Rackoff, followed in 1988 by Feige, Fiat and Shamir, zero-knowledge…