Amit Agarwal
  • 🤓About me
  • 🎓Education
  • 📰Publications
  • 🔍Research Experience
  • 🏅Achievements
  • 📄Blog Posts
  • 🧑‍🏫Teaching
  • 🏭Professional Experience
  • 👨‍💻Academic Service
  • 🤝Extracurricular Service
  • 🗞️News clippings
  • 📺Videos you might like
  • 🎤Research Talks
  • 🤔Musings
  • 📸Pics
  • 🖥️Cryptography
  • ✈️Travel
Powered by GitBook
On this page

Cryptography

This page contains a list of my favorite tricks and ideas from the literature which are useful in cryptography.

PreviousPicsNextTravel

Last updated 1 year ago

  • Zero Knowledge (ZK) proof of equality by for proving that the value inside two commitments are identical without using generic ZK (that utilizes Karp reduction). This idea is also implicitly used in Schnorr proofs for Discrete Log Equality (known as DLEQ in the literature). In , a generalization of Kilian's protocol is presented for proving any linear relation (in Z_2) among the values present in multiple commitments.

  • Cuckoo hashing, introduced in , provides a better way of avoiding collisions when maintaining hash tables. empirically analyzed the parameters of cuckoo hashing for Private Set Intersection (PSI). contains a summary of the parameters.

🖥️
[Kilian92]
[Crepeau et. al. 95]
[Pagh et. al. 04]
[Pinkas et. al. 16]
[Shah et. al. 21 Appendix A.2]