_id,doi,title
6430,10.1007/978-3-030-17259-6_11,Adaptively secure proxy re-encryption
6528,10.4230/LIPICS.ITCS.2019.60,Simple verifiable delay functions
298,10.1007/978-3-319-78375-8_4,Sustained space complexity
300,10.1007/978-3-319-78381-9_1,On the bit security of cryptographic primitives
302,10.1007/978-3-319-78375-8_15,Simple proofs of sequential work
107,10.1145/3178432,Non-malleable codes
108,10.1109/ISIT.2018.8437654,Inverted leftover hash lemma
83,10.15479/AT:ISTA:TH_1046,Proof systems for sustainable decentralized cryptocurrencies
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
7407,10.4230/LIPICS.ITCS.2019.59,Proofs of catalytic space
5980,10.3934/amc.2018002,Private set-intersection with common set-up
10286,10.13154/tches.v2018.i3.214-242,Evaluation and monitoring of free running oscillators serving as source of randomness
1174,10.4230/LIPIcs.STACS.2017.57,Lower bounds on key derivation for square-friendly applications
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
838,10.15479/AT:ISTA:th_828,(The exact security of) Message authentication codes
697,10.4230/LIPIcs.ICALP.2017.39,Non uniform attacks against pseudoentropy
710,10.4230/LIPIcs.APPROX-RANDOM.2017.20,Renyi entropy estimation revisited
559,10.1007/978-3-319-70697-9_13,"Beyond Hellman’s time-memory trade-offs with applications to proofs of space"