_id,doi,title
10041,10.1007/978-3-030-84245-1_17,"Limits on the Adaptive Security of Yao’s Garbling"
10044,,"On treewidth, separators and Yao's garbling"
10048,,The cost of adaptivity in security games on graphs
10049,10.1109/sp40001.2021.00035,"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement"
10409,10.1007/978-3-030-90453-1_17,"On treewidth, separators and Yao’s garbling"
10410,10.1007/978-3-030-90453-1_19,The cost of adaptivity in security games on graphs
7896,10.15479/AT:ISTA:7896,On the average-case hardness of total search problems
6677,10.1145/3313276.3316400,Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
7411,10.1007/978-3-030-17656-3_10,Reversible proofs of sequential work
6430,10.1007/978-3-030-17259-6_11,Adaptively secure proxy re-encryption
193,10.1145/3196494.3196534,On the memory hardness of data independent password hashing functions
5980,10.3934/amc.2018002,Private set-intersection with common set-up
637,10.1007/978-3-319-63688-7_5,Be adaptive avoid overcommitting
1177,10.1007/s00453-015-9997-6,A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
1225,10.1007/978-3-319-44618-9_21,Practical round-optimal blind signatures in the standard model from weaker assumptions
1231,10.1007/978-3-662-49896-5_13,On the complexity of scrypt and proofs of space in the parallel random oracle model