The Fiat–Shamir heuristic is a technique in cryptography for taking an interactive proof of knowledge and creating a digital signature based on it… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Irene Giacomelli, Jesper J Madsen, Claudio Orlandi
- USENIX Security Symposium
- 2016

In this paper we describe ZKBoo, a proposal for practically efficient zeroknowledge arguments especially tailored for Boolean… (More)

Is this relevant?

2015

2015

- Benoît Libert, Thomas Peters, Marc Joye, Moti Yung
- ASIACRYPT
- 2015

Quasi-adaptive non-interactive zero-knowledge (QA-NIZK) proofs is a recent paradigm, suggested by Jutla and Roy (Asiacrypt ’13… (More)

Is this relevant?

2015

2015

- Pyrros Chaidos, Jens Groth
- Public Key Cryptography
- 2015

Damg̊ard, Fazio and Nicolosi (TCC 2006) gave a transformation of Sigma-protocols, 3-move honest verifier zero-knowledge proofs… (More)

Is this relevant?

2012

2012

- Nir Bitansky, Dana Dachman-Soled, +4 authors Daniel Wichs
- TCC
- 2012

The Fiat-Shamir heuristic (CRYPTO ’86) is used to convert any 3-message public-coin proof or argument system into a non… (More)

Is this relevant?

2012

2012

- Dana Dachman-Soled, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt
- IACR Cryptology ePrint Archive
- 2012

The Fiat-Shamir paradigm [CRYPTO’86] is a heuristic for converting 3-round identification schemes into signature schemes, and… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Jens Groth
- ASIACRYPT
- 2010

We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Jens Groth
- ACNS
- 2005

In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally… (More)

Is this relevant?

2004

2004

- Jens Groth
- 2004

We apply honest verifier zero-knowledge arguments to cryptographic protocols for non-malleable commitment, voting, anonymization… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Giuseppe Ateniese, Jan Camenisch, Marc Joye, Gene Tsudik
- CRYPTO
- 2000

A group signature scheme allows a group member to sign messages anonymously on behalf of the group. However, in the case of a… (More)

Is this relevant?

1999

1999

- Dan Boneh, Matthew K. Franklin
- ACM Conference on Computer and Communications…
- 1999

We develop new schemes for anonymous authentication that support identity escrow. Our protocols also allow a prover to… (More)

Is this relevant?