Prof. Eylon Yogev

Cryptography transforms difficult mathematical problems into tools that protect privacy, verify information, and build trust in the digital world—from encrypting WhatsApp messages to securing online financial transactions. For example, two entities wishing to conduct a transaction on a blockchain must ensure that each party meets the conditions without exposing sensitive commercial details. Zero-Knowledge Proofs (ZKP) allow exactly that: proving a claim is true without revealing the underlying data.

Prof. Eylon Yogev’s research focuses on developing cryptographic protocols and proof systems that enable the secure, efficient, and private verification of computations. Among his primary research areas are short and efficient proof systems, such as SNARGs and IOPs, which are used to verify complex computations.

His work is of particular importance in the fields of Web3, blockchain, cybersecurity, and digital privacy, where it is necessary to verify transactions, smart contracts, or large-scale computations while maintaining security and trust. Part of his research also focuses on post-quantum cryptography: developing protocols designed to remain secure even in an era when quantum computers may be able to break existing encryption methods. 

Primary Research Areas:

• Zero-Knowledge Proofs

• Cryptographic Proof Systems (SNARGs & IOPs)

• Post-Quantum Cryptography

Research Nature:

 Theoretical-Applied Development of protocols and proof systems based on deep mathematical foundations, alongside applications in cybersecurity, blockchain, and verifiable computation.

Career Path:

 Graduates of the group transition into academic research and R&D roles within the field of cryptography:

• Industry: Cryptography specialists in blockchain, FinTech, and cybersecurity companies.

• Academia: Researchers and faculty members in cryptography and theoretical computer science.

• Entrepreneurship: Developers of privacy and verification protocols for Web3 systems.