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