_id,doi,title
7896,10.15479/AT:ISTA:7896,On the average-case hardness of total search problems
107,10.1145/3178432,Non-malleable codes
83,10.15479/AT:ISTA:TH_1046,Proof systems for sustainable decentralized cryptocurrencies
1187,10.1007/s00145-016-9247-3,Efficient authentication from hard learning problems
1653,10.1007/978-3-662-48797-6_6,New realizations of somewhere statistically binding hashing and positional accumulators
1479,10.1007/s00037-015-0120-9,A counterexample to the chain rule for conditional HILL entropy
1366,10.1007/978-3-662-49890-3_4,Provably robust sponge-based PRNGs and KDFs
1225,10.1007/978-3-319-44618-9_21,Practical round-optimal blind signatures in the standard model from weaker assumptions
1229,10.1007/978-3-319-39555-5_16,Offline witness encryption
1231,10.1007/978-3-662-49896-5_13,On the complexity of scrypt and proofs of space in the parallel random oracle model
1233,10.1007/978-3-662-49096-9_12,Standard security does imply security against selective opening for markov distributions
1235,10.1007/978-3-319-39555-5_24,Constrained PRFs for unbounded inputs with short keys
1236,10.1007/978-3-319-29485-8_24,Constrained PRFs for unbounded inputs
1644,10.1007/978-3-319-17470-9_10,Query-complexity amplification for random oracles
1645,10.1109/ITW.2015.7133163,Secret-key cryptography from ideal primitives: A systematic verview
1646,10.1007/978-3-662-46497-7_2,Key-homomorphic constrained pseudorandom functions
1647,10.1007/978-3-662-48000-7_12,Practical round-optimal blind signatures in the standard model
1648,10.1007/978-3-662-47989-6_29,A quasipolynomial reduction for generalized selective decryption on trees
1649,10.1007/978-3-319-24174-6_16,Efficient zero-knowledge proofs for commitments from learning with errors over rings
1650,10.1007/978-3-662-47672-7_85,Condensed unpredictability