Multi-instance security and its application to password-based cryptography
From MaRDI portal
Recommendations
Cited in
(19)- Query-complexity amplification for random oracles
- Intermundium-DL: assessing the resilience of current schemes to discrete-log-computation attacks on public parameters
- Multi-instance secure public-key encryption
- Polly cracker, revisited
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Flexible password-based encryption: securing cloud storage and provably resisting partitioning-oracle attacks
- Tightness subtleties for multi-user PKE notions
- scientific article; zbMATH DE number 7300383 (Why is no real title available?)
- New limits for homomorphic encryption
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- An algorithm for approximate membership checking with application to password security
- Everybody's a target: scalability in public-key encryption
- Password hashing and preprocessing
- A formal treatment of end-to-end encrypted cloud storage
- Cryptographic puzzles and DoS resilience, revisited
- On the adaptive security of MACs and PRFs
- Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
- Salvaging weak security bounds for blockcipher-based constructions
- Quantifying the security cost of migrating protocols to practice
This page was built for publication: Multi-instance security and its application to password-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914267)