Jens Groth: Difference between revisions
Content deleted Content added
No edit summary |
|||
| Line 2: | Line 2: | ||
== Research == |
== Research == |
||
Groth's 2016 paper, ''On the size of pairing-based non-interactive arguments'', described a succinct, noninteractive zero-knowledge proof scheme based on pairings. It is quite compact, with proofs consisting of just three group elements. It is used in several cryptocurrency protocols, such as [[Zcash]] and [[Tornado Cash]].<ref>{{Cite |
Groth's 2016 paper, ''On the size of pairing-based non-interactive arguments'', described a succinct, noninteractive zero-knowledge proof scheme based on pairings, commonly referred to as "Groth16".<ref>{{Cite conference |title=On the Size of Pairing-Based Non-interactive Arguments |last=Groth |first=Jens |conference=EUROCRYPT 2016 |publisher=Springer}}</ref> It is quite compact, with proofs consisting of just three group elements. It is used in several cryptocurrency protocols, such as [[Zcash]] and [[Tornado Cash]].<ref>{{Cite web |title=Groth16 | last=Bloemen |first=Remco |url=https://2%CF%80.com/22/groth16/}}</ref> A subsequent work by Helger Lipmaa showed that even smaller proofs are possible, reducing proof sizes from 1792 bits to 1408 bits for practical parameters.<ref>{{Cite conference |title=Polymath: Groth16 Is Not the Limit |last=Lipmaa |first=Helger |conference=CRYPTO 2024 |publisher=Springer}}</ref> |
||
== References == |
== References == |
||
Revision as of 16:34, 23 October 2024
Jens Groth is a cryptographer, the Chief Scientist at Neuxs, and formerly a professor at University College London. He is known for his work on pairing-based cryptography and zero-knowledge proofs.
Research
Groth's 2016 paper, On the size of pairing-based non-interactive arguments, described a succinct, noninteractive zero-knowledge proof scheme based on pairings, commonly referred to as "Groth16".[1] It is quite compact, with proofs consisting of just three group elements. It is used in several cryptocurrency protocols, such as Zcash and Tornado Cash.[2] A subsequent work by Helger Lipmaa showed that even smaller proofs are possible, reducing proof sizes from 1792 bits to 1408 bits for practical parameters.[3]