Scalable and Fine-Tuned Privacy Pass from Group Verifiable Random Functions.

Extending the Security of SPDZ with Fairness.

Direct FSS Constructions for Branching Programs and More from PRGs with Encoded-Output Homomorphism.

Communication-Efficient Multi-Party Computation for RMS Programs.

Topology-Hiding Communication from Minimal Assumptions.

Oblivious Transfer with Constant Computational Overhead.

Towards Topology-Hiding Computation from Oblivious Transfer.

On Homomorphic Secret Sharing from Polynomial-Modulus LWE.

Efficient Pseudorandom Correlation Generators from Ring-LPN.

Correlated Pseudorandomness from Expand-Accumulate Codes.

Towards Tight Adaptive Security of Non-Interactive Key Exchange.

A Compressed Σ-Protocol Theory for Lattices.

Correlated Pseudorandom Functions from Variable-Density LPN.

Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs.

Homomorphic Secret Sharing from Lattices Without FHE.

Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation.

On Tightly Secure Non-Interactive Key Exchange.

More Efficient (Almost) Tightly Secure Structure-Preserving Signatures.

Kurosawa-Desmedt Meets Tight Security.

New Tools for Multi-Party Computation.