On Memory-Bound Functions for Fighting Spam

This publication has 18 references indexed in Scilit:

• Handbook of Applied Cryptography
  Published by Taylor & Francis ,2018
• A non-linear time lower bound for Boolean branching programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• Super-linear time-space tradeoff lower bounds for randomized computation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Short Signatures from the Weil Pairing
  Published by Springer Nature ,2001
• Pricing via Processing or Combatting Junk Mail
  Published by Springer Nature ,2001
• An Efficient Existentially Unforgeable Signature Scheme and Its Applications
  Journal of Cryptology, 1998
• Fast batch verification for modular exponentiation and digital signatures
  Lecture Notes in Computer Science, 1998
• Batch verification with applications to cryptography and checking
  Published by Springer Nature ,1998
• Batch RSA
  Journal of Cryptology, 1997
• Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
  Computer, 1977