Results (15)

  • Depth-robust graphs and their cumulative memory complexity
    Conference paper
  • Scrypt is maximally memory hard
    Conference paper
  • Provably robust sponge-based PRNGs and KDFs
    Conference paper
  • Key derivation without entropy waste
    Conference paper
  • Message authentication, revisited
    Conference paper
  • Efficient authentication from hard learning problems
    Conference paper
  • A new randomness extraction paradigm for hybrid encryption
    Conference paper
  • On the security of padding based encryption schemes Why We cannot prove OAEP secure in the standard model
    Conference paper
  • A new mode of operation for block ciphers and length preserving MACs
    Conference paper