Accepted Papers

3 Party Distributed ORAM from Oblivious Set Membership
Brett Hemenway Falk, Daniel Noble and Rafail Ostrovsky.

A Provably Secure, Lightweight Protocol for Anonymous Authentication
Jonathan Katz.

Anonymous Authenticated Communication
Fabio Banfi and Ueli Maurer.

Approximate Distance-Comparison-Preserving Symmetric Encryption
Georg Fuchsbauer, Riddhi Ghosal, Nathan Hauke and Adam O’Neill.

Black-box Anonymous Commit-and-Prove
Alessandra Scafuro.

Cost-Asymmetric Memory Hard Password Hashing
Wenjie Bai, Jeremiah Blocki and Mohammad Hassan Ameri.

Credential Transparency System
Melissa Chase, Georg Fuchsbauer, Esha Ghosh and Antoine Plouviez.

Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions
Benoît Libert, Ky Nguyen and Alain Passelègue.

Decoding McEliece with a Hint — Secret Goppa Key Parts Reveal Everything
Elena Kirshanova and Alexander May.

Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System
Titouan Tanguy, Cyprien Delpech de Saint Guilhem, Emmanuela Orsini and Michiel Verbauwhede.

Finding One Common Item, Privately
Tyler Beauregard, Janabel Xia and Mike Rosulek.

Higher-order masked Saber
Suparna Kundu, Jan-Pieter D’Anvers, Michiel Van Beirendonck, Angshuman Karmakar and Ingrid Verbauwhede.

Inner Product Functional Commitments with Constant-Size Public Parameters and Openings
Hien Chu, Dario Fiore, Dimitris Kolonelos and Dominique Schröder.

Key-Policy ABE with Switchable Attributes
Lénaïck Gouriou, David Pointcheval and Cécile Delerablée.

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
Mohammad Hassan Ameri Ekhtiarabadi, Alexander Block and Jeremiah Blocki.

Mix-Nets from Re-Randomizable and Replayable CCA-secure Public-Key Encryption
Antonio Faonio and Luigi Russo.

mrNISC from LWE with Polynomial Modulus
Sina Shiehian

MyOPE: Malicious securitY for Oblivious Polynomial Evaluation
Malika Izabachène, Anca Nitulescu, Paola de Perthuis and David Pointcheval.

New and Improved Constructions for Partially Equivocable Public Key Encryption
Benoît Libert, Alain Passelègue and Mahshid Riahinia.

NIWI and New Notions of Extraction for Algebraic Languages
Chaya Ganesh, Hamidreza Khoshakhlagh and Roberto Parisella.

On Access Control Encryption without Sanitization
Cecilia Boschini, Ivan Damgard and Claudio Orlandi.

On Sufficient Oracles for Secure Computation with Identifiable Abort
Mark Simkin, Luisa Siniscalchi and Sophia Yakoubov.

On the Related-Key Attack Security of Authenticated Encryption Schemes
Sebastian Faust, Juliane Krämer, Maximilian Orlt and Patrick Struck.

Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares
Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky and Antigoni Polychroniadou.

RAMus – a New Lightweight Block Cipher for RAM Encryption
Raluca Posteuca and Vincent Rijmen.

Scooby: Improved Multi-Party Homomorphic Secret Sharing Based on FHE
Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, 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.

Succinct Attribute-Based Signatures for Bounded-Size Circuits by Combining Algebraic and Arithmetic Proofs
Yusuke Sakai.

The State of the Union: Union-Only Signatures for Data Aggregation
Diego F. Aranha, Felix Engelmann, Sebastian Kolby and Sophia Yakoubov.

Traceable Constant-Size Multi-Authority Credentials
Chloé Hébant and David Pointcheval.

Watermarkable Public key Encryption With Efficient Extraction Under Standard Assumptions
Foteini Baldimtsi, Aggelos Kiayias and Katerina Samari.

What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation Extractable?
Chaya Ganesh, Hamidreza Khoshakhlagh, Markulf Kohlweiss, Anca Nitulescu and Michal Zajac.

Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers
Matteo Campanelli, Felix Engelmann and Claudio Orlandi.