Caleb Geren
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Caleb Geren has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Benjamin Aulenbach
Macguyver Tech, USA
1 shared publication - Henry F. Korth
Lehigh University, USA
1 shared publication - Jonathan Klein
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication - Michael Kaufman
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication - Rishad Islam Shanto
Lehigh University Bethlehem Pennsylvania USA
1 shared publication - Tal Derei
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication
Latest Publications
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Scaling Zero-Knowledge to Verifiable Databases
Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessScaling Zero-Knowledge to Verifiable Databases
Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.