DOI,IST REx ID,Research Group,Title of publication
10.13154/tches.v2018.i3.214-242,10286,KrPi,Evaluation and monitoring of free running oscillators serving as source of randomness
10.15479/AT:ISTA:TH_1046,83,"KrPi,GradSch",Proof systems for sustainable decentralized cryptocurrencies
10.3934/amc.2018002,5980,KrPi,Private set-intersection with common set-up
10.4230/LIPIcs.STACS.2017.57,1174,KrPi,Lower bounds on key derivation for square-friendly applications
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/s00145-016-9247-3,1187,KrPi,Efficient authentication from hard learning problems
10.1007/978-3-319-70500-2_3,605,KrPi,Position based cryptography and multiparty communication complexity
10.1007/978-3-319-70500-2_17,609,KrPi,"Moderately hard functions: Definition, instantiations, and applications"
10.13154/TOSC.V2016.I2.145-161,6196,KrPi,The exact security of PMAC
10.1007/978-3-319-56617-7_2,635,KrPi,Scrypt is maximally memory hard
10.1007/978-3-319-63688-7_5,637,KrPi,Be adaptive avoid overcommitting
10.1007/978-3-319-56617-7_1,640,KrPi,Depth-robust graphs and their cumulative memory complexity
10.15479/AT:ISTA:th_828,838,KrPi,(The exact security of) Message authentication codes
10.1007/978-3-319-55911-7_43,648,KrPi,On the complexity of breaking pseudoentropy
10.1007/978-3-319-55911-7_42,650,KrPi,A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
10.1145/3133956.3134031,6527,KrPi,Practical graphs for optimal side-channel resistant memory-hard functions
10.4230/LIPIcs.ICALP.2017.39,697,KrPi,Non uniform attacks against pseudoentropy
10.4230/LIPIcs.APPROX-RANDOM.2017.20,710,KrPi,Renyi entropy estimation revisited
10.1109/isit.2017.8006529,6526,KrPi,On the complexity of estimating Rènyi divergences