Search this site
Embedded Files
Yale Applied Cryptography Laboratory
  • Home
  • People
  • Seminar
  • Teaching
  • Funding
  • Calendar
Yale Applied Cryptography Laboratory
  • Home
  • People
  • Seminar
  • Teaching
  • Funding
  • Calendar
  • More
    • Home
    • People
    • Seminar
    • Teaching
    • Funding
    • Calendar

We moved to:

https://yacl.cs.yale.edu

We are a group of researchers at Yale working on applied cryptography

News

  • 29 Dec 2025. Congratulations to Arthur Lazzaretti on a successful PhD journey, culminating in an excellent defense, and on his new position at xAI! 

  • 29 Dec 2025. Check out our two newly accepted papers (listed in reverse chronological order):

    • InstantOMR: Oblivious Message Retrieval with Low Latency and Optimal Parallelizability (USENIXSEC'26)

    • Cirrus: Performant and Accountable Distributed SNARK (NDSS'26)

  • 08 Nov 2025. We would like to congratulate lab member Aviv Yaish for several accomplishments:

    • Inequality in the Age of Pseudonymity was accepted to AAAI'26

    • Receiving three grants from the Ethereum Foundation and the Columbia Business School Digital Future Initiative

    • Inclusion in the CBER Forum’s Rising Stars and the Hebrew University's 40 Under 40 Young Leaders of '25 lists

  • 01 Sep 2025. We are proud of group member Kaihua Qin's acceptance as an Assistant Professor at the University of Warwick!

  • 30 Aug 2025. Several exciting papers (co-)led by our group members have been accepted or published this summer! 🎉 Listed in reverse chronological order:

    • Multi-Server Doubly Efficient PIR in the Classical Model and Beyond (TCC'25)

    • Lattice-based Multi-message Multi-recipient KEM/PKE with Malicious Security (Asiacrypt'25)

    • PriFHEte: Achieving Full-Privacy in Account-based Cryptocurrencies is Possible (Asiacrypt'25)

    • IND-CPA-D of Relaxed Functional Bootstrapping: A New Attack, A General Fix, and A Stronger Model (CCS'25)

    • Maximal Extractable Value in Batch Auctions (EC'25)

    • Scalable Private Signaling (CSF'25)

  • 20 May 2025. We congratulate Georgios (Giorgos) Tsimos for successfully defending his excellent PhD and joining Pod Network as a scientist!

  • 04 Apr 2025. Do join us on Apr. 11th for the 2nd PAVE blockchain symposium!

  • 17 Mar 2025. We are glad to announce that several YACL members have joined IC3 (Tiantian Gong, Giannis Kaklamanis, Kaihua Qin, Wenhao Wang, Yunhao Wang, Aviv Yaish, Sen Yang, Fan Zhang, and Mengqian Zhang)!

  • 15 Mar 2025. Three papers by YACL members just got accepted to S&P'25:

    • Decentralization of Ethereum's Builder Market

    • Permissionless Verifiable Information Dispersal (Data Availability for Bitcoin Rollups)

    • HydraProofs: Optimally Computing All Proofs in a Vector Commitment (with applications to efficient zkSNARKs over data from multiple users)

  • 10 Feb 2025. We are proud to announce that two YACL papers were accepted to USENIXSEC'25:

    • Recover from Excessive Faults in Partially-Synchronous BFT SMR

    • Qelect: Lattice-based Single Secret Leader Election Made Practical

  • 07 Feb 2025. Several interesting papers by lab members have been accepted to Eurocrypt'25:

    • Blaze: Fast SNARKs from Interleaved RAA Codes

    • Disincentivize Collusion in Verifiable Secret Sharing

    • Snake-eye Resistant PKE from LWE for Oblivious Message Retrieval and Robust Encryption

  • 31 Jan 2025. Today we're kicking-off our seminar series for this semester, do join us in-person or online.

  • 13 Jan 2025. We welcome Jiasun Li (George Mason University, Costello College of Business), who is joining us this semester as a visiting professor!

  • 06 Dec 2024. Be sure to check our lab members' recent batch of FC'25 papers!

    • Prooφ: A ZKP Market Mechanism

    • Robust Double Auctions for Resource Allocation

    • Towards Optimal Parallel Broadcast under a Dishonest Majority

    • Rational Secret Sharing with Competition

    • The Case of FBA as a DEX Processing Model

TwitterYouTubeEmail
Google Sites
Report abuse
Google Sites
Report abuse