DOI,IST REx ID,Research Group,Title of publication
10.1007/978-3-031-71073-5_14,18086,"GradSch,KrPi","DeCAF: Decentralizable CGKA with fast healing"
10.1007/978-3-030-90456-2_8,10408,KrPi,Grafting key trees: Efficient key management for overlapping groups
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-319-78375-8_4,298,KrPi,Sustained space complexity
10.1145/3196494.3196534,193,"KrPi,HeEd,VlKo",On the memory hardness of data independent password hashing functions
10.1007/978-3-662-58387-6_26,6941,KrPi,SpaceMint: A cryptocurrency based on proofs of space
10.4230/LIPIcs.ITCS.2017.38,1175,KrPi,Cumulative space in black-white pebbling and resolution
10.1109/EuroSP.2017.47,1176,KrPi,Towards practical attacks on Argon2i and balloon hashing
10.1007/978-3-319-70500-2_17,609,KrPi,"Moderately hard functions: Definition, instantiations, and applications"
10.1007/978-3-319-56617-7_2,635,KrPi,Scrypt is maximally memory hard
10.1007/978-3-319-56617-7_1,640,KrPi,Depth-robust graphs and their cumulative memory complexity
10.1145/3133956.3134031,6527,KrPi,Practical graphs for optimal side-channel resistant memory-hard functions
10.1007/978-3-319-70697-9_13,559,KrPi,"Beyond Hellman’s time-memory trade-offs with applications to proofs of space"
10.1007/978-3-662-53008-5_9,1365,KrPi,Efficiently computing data-independent memory-hard functions
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
10.1145/2746539.2746622,1652,KrPi,High parallel complexity graphs and memory-hard functions
10.1007/978-3-662-48000-7_37,1672,KrPi,Incoercible multi-party computation and universally composable receipt-free voting
10.1007/978-3-642-40041-4_4,2259,KrPi,"Learning with rounding, revisited: New reduction properties and applications"