Preliminary program

Early Registration deadline: July 31.

Sunday September 11

19:00 – 20:30 Registration & Welcome Cocktail

Monday September 12

08:50 – 09:00 Opening Remarks

09:00-10:40 Zero-Knowledge Proofs and Applications I

  • Black-box Anonymous Commit-and-Prove
    Alessandra Scafuro
  • Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System
    Titouan Tanguy and Cyprien Delpech de Saint Guilhem and Emmanuela Orsini and Michiel Verbauwhede
  • Inner Product Functional Commitments with Constant-Size Public Parameters and Openings
    Hien Chu and Dario Fiore and Dimitris Kolonelos and Dominique Schröder
  • MyOPE: Malicious securitY for Oblivious Polynomial Evaluation
    Malika Izabachène and Anca Nitulescu and Paola de Perthuis and David Pointcheval

10:40 – 11:10 Coffee Break

11:10 – 12:25 Ciphers, Cryptanalysis, Defenses I

  • Decoding McEliece with a Hint – Secret Goppa Key Parts Reveal Everything
    Elena Kirshanova and Alexander May
  • Cost-Asymmetric Memory Hard Password Hashing
    Wenjie Bai and Jeremiah Blocki and Mohammad Hassan Ameri
  • Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
    Mohammad Hassan Ameri and Alexander Block and Jeremiah Blocki

12:25 – 15:00 Lunch Break

15:00 – 16:00 Invited Talk

  • From Galactic PCP theory to scaling blockchains with ZK-STARKs
    Eli Ben-Sasson

16:00 – 16:30 Coffee Break

16:30 – 18:05 Multiparty Computation I

  • 3 Party Distributed ORAM from Oblivious Set Membership
    Brett Hemenway Falk and Daniel Noble and Rafail Ostrovsky
  • Finding One Common Item, Privately
    Tyler Beauregard and Janabel Xia and Mike Rosulek
  • mrNISC from LWE with Polynomial Modulus
    Sina Shiehian
  • On Sufficient Oracles for Secure Computation with Identifiable Abort
    Mark Simkin and Luisa Siniscalchi and Sophia Yakoubov

Tuesday September 13

09:00 – 10:00 Invited Talk

  • How to Do Cryptography Even When Cryptography Doesn’t Exist
    Marshall Ball

10:00 – 10:30 Coffee Break

10:30 – 12:35 Public Key Encryption

  • Key-Policy ABE with Switchable Attributes
    Lénaïck Gouriou and David Pointcheval and Cécile Delerablée
  • Mix-Nets from Re-Randomizable and Replayable CCA-secure Public-Key Encryption
    Antonio Faonio and Luigi Russo
  • New and Improved Constructions for Partially Equivocable Public Key Encryption
    Benoît Libert and Alain Passelègue and Mahshid Riahinia
  • On Access Control Encryption without Sanitization
    Cecilia Boschini and Ivan Damgärd and Claudio Orlandi
  • Watermarkable Public key Encryption With Efficient Extraction Under Standard Assumptions
    Foteini Baldimtsi and Aggelos Kiayias and Katerina Samari

12:35 – 15:00 Lunch Break

15:00 – 16:15 Ciphers, Cryptanalysis, Defenses II

  • RAMus – a New Lightweight Block Cipher for RAM Encryption
    Raluca Posteuca and Vincent Rijmen
  • Higher-order masked Saber
    Suparna Kundu and Jan-Pieter D’Anvers and Michiel Van Beirendonck and
    Angshuman Karmakar and Ingrid Verbauwhede
  • Approximate Distance-Comparison-Preserving Symmetric Encryption
    Georg Fuchsbauer and Riddhi Ghosal and Nathan Hauke and Adam O’Neill

16:15 – 16:45 Coffee Break

16:45 – 17:35 Zero-Knowledge Proofs and Applications II

  • NIWI and New Notions of Extraction for Algebraic Languages
    Chaya Ganesh and Hamidreza Khoshakhlagh and Roberto Parisella
  • Succinct Attribute-Based Signatures for Bounded-Size Circuits by Combining Algebraic and Arithmetic Proofs
    Yusuke Sakai

18:00 – 20:00 Excursion

20:30 Social Dinner

Wednesday September 14

09:00 – 10:15 Multiparty Computation II

  • Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares
    Surya Addanki and Kevin Garbe and Eli Jaffe and Rafail Ostrovsky and Antigoni Polychroniadou
  • Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE
    Ilaria Chillotti and Emmanuela Orsini and Peter Scholl and Nigel Smart and Barry Van Leeuwen
  • Streaming and Unbalanced PSI from Function Secret Sharing
    Samuel Dittmer, Yuval Ishai, Steve Lu, Rafail Ostrovsky, Mohamed Elsabagh, Nikolaos Kiourtis, Brian Schulte and Angelos Stavrou

10:15 – 10:45 Coffee Break

10:45 – 12:25 Authentication and Signatures I

  • Anonymous Authenticated Communication
    Fabio Banfi and Ueli Maurer
  • Credential Transparency System
    Melissa Chase and Georg Fuchsbauer and Esha Ghosh and Antoine Plouviez
  • Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions
    Benoît Libert and Ky Nguyen and Alain Passelégue
  • On the Related-Key Attack Security of Authenticated Encryption Schemes
    Sebastian Faust and Juliane Krämer and Maximilian Orlt and Patrick Struck

12:25 – 15:00 Lunch Break

15:00 – 16:15 Authentication and Signatures II

  • A Provably Secure, Lightweight Protocol for Anonymous Authentication
    Jonathan Katz
  • The State of the Union: Union-Only Signatures for Data Aggregation
    Diego F. Aranha and Felix Engelmann and Sebastian Kolby and Sophia Yakoubov
  • Traceable Constant-Size Multi-Authority Credentials
    Chloé Hébant and David Pointcheval

16:15 – 16:45 Coffee Break

16:45 – 17:35 Zero-Knowledge Proofs and Applications III

  • What Makes FiatShamir zkSNARKs (Updatable SRS) Simulation Extractable?
    Chaya Ganesh and Hamidreza Khoshakhlagh and Markulf Kohlweiss and Anca Nitulescu and Michal Zajac
  • Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers
    Matteo Campanelli and Felix Engelmann and Claudio Orlandi

17:35 Closing Remarks & Farewell