Efficient Proofs of Secure Erasure
暂无分享,去创建一个
[1] Moni Naor,et al. Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.
[2] Jakob Nordstr,et al. New Wine into Old Wineskins: A Survey of Some Pebbling Classics with Supplemental Results , 2015 .
[3] Claudio Soriente,et al. On the difficulty of software-based attestation of embedded devices , 2009, CCS.
[4] Noga Alon,et al. Smaller Explicit Superconcentrators , 2003, Internet Math..
[5] Ellis Horowitz,et al. Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.
[6] Martin E. Hellman,et al. A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.
[7] Amos Fiat,et al. Rigorous Time/Space Trade-offs for Inverting Functions , 1999, SIAM J. Comput..
[8] Stefan Dziembowski,et al. Proofs of Space , 2015, CRYPTO.
[9] Ye Zhang,et al. Near-linear time, Leakage-resilient Key Evolution Schemes from Expander Graphs , 2013, IACR Cryptol. ePrint Arch..
[10] Madhur Tulsiani,et al. Time Space Tradeoffs for Attacks against One-Way Functions and PRGs , 2010, CRYPTO.
[11] Gene Tsudik,et al. Secure Code Update for Embedded Devices via Proofs of Secure Erasure , 2010, ESORICS.
[12] Robert E. Tarjan,et al. Space Bounds for a Game of Graphs , 1976, STOC.
[13] Stefan Dziembowski,et al. One-Time Computable Self-erasing Functions , 2011, TCC.
[14] Giuseppe Ateniese,et al. Proofs of Space: When Space Is of the Essence , 2014, SCN.