_id,title
10048,The cost of adaptivity in security games on graphs
10049,"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement"
10407,Trojan-resilience without cryptography
10408,Grafting key trees: Efficient key management for overlapping groups
10409,"On treewidth, separators and Yao’s garbling"
10410,The cost of adaptivity in security games on graphs
10609,Reverse firewalls for adaptively secure MPC without setup
9825,Dual lattice attacks for closest vector problems (with preprocessing)
9826,Inverse-Sybil attacks in automated contact tracing
9969,LightPIR: Privacy-preserving route discovery for payment channel networks
7896,On the average-case hardness of total search problems
7966,"Everybody’s a target: Scalability in public-key encryption"
8322,"Reverse firewalls for actively secure MPCs"
8339,Improved discrete Gaussian and subgaussian analysis for lattice cryptography
8987,Delayed authentication: Preventing replay and relay attacks in private contact tracing
6677,Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
6726,Sampling the integers with low relative error
7136,Strong chain rules for min-entropy under few bits spoiled
7411,Reversible proofs of sequential work
5887,Per-session security: Password-based cryptography revisited