Jens Groth: Difference between revisions
Content deleted Content added
No edit summary |
revised all citations |
||
| Line 3: | Line 3: | ||
== 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, commonly referred to as "Groth16".<ref>{{Cite conference |title=On the Size of Pairing-Based Non-interactive Arguments | |
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 |last=Groth |first=Jens |date=28 April 2016 |title=On the Size of Pairing-Based Non-interactive Arguments |url=https://link.springer.com/chapter/10.1007/978-3-662-49896-5_11 |conference=Annual International Conference on the Theory and Applications of Cryptographic Techniques |pages=305–326 |doi=10.1007/978-3-662-49896-5_11 |isbn=978-3-662-49896-5 |via=Springer Nature Link |doi-access=free}}<!-- This is a primary citation, rather than a secondary, and I'm concerned about using it as a notability supporting citation. --></ref> It is quite compact, with proofs consisting of just three group elements. The construction is used in several cryptocurrency protocols, such as [[Zcash]] and [[Tornado Cash]].<ref>{{Cite tech report|last=Bloemen|first=Remco|date=24 July 2024|title=Groth16}}<!-- I am somewhat concerned about this citation - it is in essence a very technical blog post, which is why I cited it as a Technical Report, but maybe it should not be allowed as the author is not "notable" from a Wikipedia point of view. --> |
||
</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 |last=Lipmaa |first=Helger |date=16 August 2024 |title=Polymath: Groth16 Is Not the Limit |url=https://link.springer.com/chapter/10.1007/978-3-031-68403-6_6 |conference=Annual International Cryptology Conference |pages=170–206 |doi=10.1007/978-3-031-68403-6_6 |isbn=978-3-031-68403-6 |via=Springer Nature Link}}</ref> |
|||
== References == |
== References == |
||
Revision as of 01:24, 2 November 2024
Jens Groth is a cryptographer known for his work on pairing-based cryptography and zero-knowledge proofs. He received a PhD in computer science from Aarhus University, and was a professor at University College London. He later left the university to become the Chief Scientist at Neuxs.
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. The construction 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]
References
- ^ Groth, Jens (28 April 2016). On the Size of Pairing-Based Non-interactive Arguments. Annual International Conference on the Theory and Applications of Cryptographic Techniques. pp. 305–326. doi:10.1007/978-3-662-49896-5_11. ISBN 978-3-662-49896-5 – via Springer Nature Link.
- ^ Bloemen, Remco (24 July 2024). Groth16 (Technical report).
- ^ Lipmaa, Helger (16 August 2024). Polymath: Groth16 Is Not the Limit. Annual International Cryptology Conference. pp. 170–206. doi:10.1007/978-3-031-68403-6_6. ISBN 978-3-031-68403-6 – via Springer Nature Link.