1![Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories ECC Workshop 2013, 2013–09–17 Indifferentiable Hashing to Elliptic and Hyperelliptic Curves Mehdi Tibouchi NTT Secure Platform Laboratories ECC Workshop 2013, 2013–09–17](https://www.pdfsearch.io/img/b7b00d217070ddb9c41c4622935d3fbc.jpg) | Add to Reading ListSource URL: www.cosic.esat.kuleuven.beLanguage: English - Date: 2013-10-09 09:45:18
|
---|
2![Lanarea DF Haneef Mubarak Abstract The flaws of current and previous methods of utilization, storage, and conversion of passwords into secure keys, namely plaintext, hashing, and key derivation are explored. A novel, yet Lanarea DF Haneef Mubarak Abstract The flaws of current and previous methods of utilization, storage, and conversion of passwords into secure keys, namely plaintext, hashing, and key derivation are explored. A novel, yet](https://www.pdfsearch.io/img/018b28c68177a273854edf3fa0fcc394.jpg) | Add to Reading ListSource URL: password-hashing.netLanguage: English |
---|
3![Secure Names for Bit-Strings Stuart Haber* W. Scott Stornetta* Secure Names for Bit-Strings Stuart Haber* W. Scott Stornetta*](https://www.pdfsearch.io/img/6183c429aee6b8d664ae6412131e2592.jpg) | Add to Reading ListSource URL: nakamotoinstitute.orgLanguage: English - Date: 2014-03-23 11:44:47
|
---|
4![Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, Korea Preimage Attacks On Provably Secure FFT Hashing proposed at Second Hash Workshop in 2006 Donghoon Chang Center for Information Security Technologies(CIST), Korea University, Korea](https://www.pdfsearch.io/img/72ab1e460f4727677be66ef20ca5ced2.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2006-12-04 19:34:48
|
---|
5![Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find near-collisions for a hash Time-memory Trade-offs for Near-collisions Gaëtan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find near-collisions for a hash](https://www.pdfsearch.io/img/d8b5279b72d14e1f73306b421c896818.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2012-12-31 14:07:22
|
---|
6![SCORAM: Oblivious RAM for Secure Computation ∗ Xiao Shaun Wang SCORAM: Oblivious RAM for Secure Computation ∗ Xiao Shaun Wang](https://www.pdfsearch.io/img/de290b66e75944a46170d3f354113c5f.jpg) | Add to Reading ListSource URL: i.cs.hku.hkLanguage: English - Date: 2014-09-26 10:55:17
|
---|
7![Fast Privacy-Preserving Top-𝑘 Queries using Secret Sharing (Invited Paper) Martin Burkhart Xenofontas Dimitropoulos Fast Privacy-Preserving Top-𝑘 Queries using Secret Sharing (Invited Paper) Martin Burkhart Xenofontas Dimitropoulos](https://www.pdfsearch.io/img/0a2f8d42cae54e89359dd439d36da4b2.jpg) | Add to Reading ListSource URL: sepia.ee.ethz.chLanguage: English - Date: 2011-01-06 04:06:32
|
---|
8![Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking Dwaine Clarke? , Srinivas Devadas, Marten van Dijk?? , Blaise Gassend, G. Edward Suh MIT Computer Science and Artificial Intelligence Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking Dwaine Clarke? , Srinivas Devadas, Marten van Dijk?? , Blaise Gassend, G. Edward Suh MIT Computer Science and Artificial Intelligence](https://www.pdfsearch.io/img/3d304234b3bebb7fc1023c1bf2cfb05b.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2008-09-15 00:54:54
|
---|
9![Rig: A simple, secure and flexible design for Password Hashing Donghoon Chang, Arpan Jati, Sweta Mishra, Somitra Kumar Sanadhya Indraprastha Institute of Information Technology, Delhi (IIIT-D), India {donghoon,arpanj,swe Rig: A simple, secure and flexible design for Password Hashing Donghoon Chang, Arpan Jati, Sweta Mishra, Somitra Kumar Sanadhya Indraprastha Institute of Information Technology, Delhi (IIIT-D), India {donghoon,arpanj,swe](https://www.pdfsearch.io/img/30ea0a6b2d30010a20948a89370c00d6.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-07 03:55:02
|
---|
10![Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure Tobias Pulls Roel Peeters Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure Tobias Pulls Roel Peeters](https://www.pdfsearch.io/img/f8f0e2a374f1382068d8541b7b7d1aed.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-15 08:57:40
|
---|