_id,doi,title
10049,10.1109/sp40001.2021.00035,"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement"
10408,10.1007/978-3-030-90456-2_8,Grafting key trees: Efficient key management for overlapping groups
298,10.1007/978-3-319-78375-8_4,Sustained space complexity
193,10.1145/3196494.3196534,On the memory hardness of data independent password hashing functions
6941,10.1007/978-3-662-58387-6_26,SpaceMint: A cryptocurrency based on proofs of space
1175,10.4230/LIPIcs.ITCS.2017.38,Cumulative space in black-white pebbling and resolution
1176,10.1109/EuroSP.2017.47,Towards practical attacks on Argon2i and balloon hashing
559,10.1007/978-3-319-70697-9_13,"Beyond Hellman’s time-memory trade-offs with applications to proofs of space"
609,10.1007/978-3-319-70500-2_17,"Moderately hard functions: Definition, instantiations, and applications"
635,10.1007/978-3-319-56617-7_2,Scrypt is maximally memory hard
640,10.1007/978-3-319-56617-7_1,Depth-robust graphs and their cumulative memory complexity
6527,10.1145/3133956.3134031,Practical graphs for optimal side-channel resistant memory-hard functions
1365,10.1007/978-3-662-53008-5_9,Efficiently computing data-independent memory-hard functions
1231,10.1007/978-3-662-49896-5_13,On the complexity of scrypt and proofs of space in the parallel random oracle model
1652,10.1145/2746539.2746622,High parallel complexity graphs and memory-hard functions
1672,10.1007/978-3-662-48000-7_37,Incoercible multi-party computation and universally composable receipt-free voting
2259,10.1007/978-3-642-40041-4_4,"Learning with rounding, revisited: New reduction properties and applications"