1

Efficient Registration-Based Encryption
Efficient Laconic Cryptography from Learning With Errors
Zero-Knowledge Arguments for Subverted RSA Groups
Succinct Zero-Knowledge Batch Proofs for Set Accumulators
Ring Signatures with User-Controlled Linkability
Inner Product Functional Commitments with Constant-Size Public Parameters and Openings
Groth-Sahai Proofs Are Not That Scary
Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular
Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage