- Secure and Efficient Digital Signatures
- Project Year:
2024
- REU Student (s):
Justin Kim | Rutgers University-New Brunswick NJ
- Student 1 Institution:
Rutgers University-New Brunswick
- Project Mentor:
Periklis Papakonstantinou
- Project Mentor Area:
Management Science and Information Systems
- Project Abstract:
Essentially all of cryptography requires the use of unproven assumptions, and much work is dedicated to relaxing these assumptions as much as possible. Digital signatures were thought to require public-key cryptographic primitives until 1989, when Naor and Yung proposed the class of Universal One-Way Hash Function families, which can be constructed from injective one-way functions, a private-key primitive. This assumption was later relaxed again to arbitrary one-way functions. Naor and Yung showed these hash functions are sufficient to construct efficient cryptographically secure digital signature schemes, however, in their original paper, many details and proofs are omitted for this claim. Most of this project is dedicated to analyzing and replicating Naor and Yung's result with full exposition, and we worked towards improving their scheme in different settings.
