Secure Hash Algorithms

Results: 25



#Item
1Indifferentiable 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

Add to Reading List

Source URL: www.cosic.esat.kuleuven.be

Language: English - Date: 2013-10-09 09:45:18
2Lanarea 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

Add to Reading List

Source URL: password-hashing.net

Language: English
3Secure Names for Bit-Strings Stuart Haber*  W. Scott Stornetta*

Secure Names for Bit-Strings Stuart Haber* W. Scott Stornetta*

Add to Reading List

Source URL: nakamotoinstitute.org

Language: English - Date: 2014-03-23 11:44:47
4Preimage 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2006-12-04 19:34:48
5Time-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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2012-12-31 14:07:22
6SCORAM: Oblivious RAM for Secure Computation  ∗ Xiao Shaun Wang

SCORAM: Oblivious RAM for Secure Computation ∗ Xiao Shaun Wang

Add to Reading List

Source URL: i.cs.hku.hk

Language: English - Date: 2014-09-26 10:55:17
7Fast 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

Add to Reading List

Source URL: sepia.ee.ethz.ch

Language: English - Date: 2011-01-06 04:06:32
8Incremental 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

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2008-09-15 00:54:54
9Rig: 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-07 03:55:02
10Balloon: 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

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-15 08:57:40