Efficient proofs of secure erasure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8642, Issue , 2014, Pages 520-537

  Karvelas, Nikolaos P ^a   Kiayias, Aggelos ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF ATHENS   (Greece)

Author keywords

Graph Pebbling; Space bounded adversaries; Time Space Tradeoffs

Indexed keywords

CHROMIUM COMPOUNDS; COMPLEX NETWORKS; CRYPTOGRAPHY;

COMMUNICATION COMPLEXITY; COMPUTATION COMPLEXITY; GRAPH PEBBLING; QUASI-LINEAR; SECURE ERASURES; SPACE-BOUNDED ADVERSARIES; SUBLINEAR; TIME/SPACE TRADEOFFS;

NETWORK SECURITY;

EID: 84927615559     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-10879-7_30     Document Type: Conference Paper

References (14)

1. Alon, N., Capalbo, M.R.: Noga Alon and Michael R. Capalbo. Smaller explicit superconcentrators. Internet Mathematics 1(2), 151-163 (2003)
2. Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: When space is of the essence. Cryptology ePrint Archive, Report 2013/805 (2013), http://eprint.iacr.org/
3. Castelluccia, C., Francillon, A., Perito, D., Soriente, C.: On the difficulty of software-based attestation of embedded devices. In: ACM Conference on Computer and Communications Security, pp. 400-409 (2009)
4. De, A., Trevisan, L., Tulsiani, M.: Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649-665. Springer, Heidelberg (2010)
5. Dwork, C., Naor, M.: Pricing via Processing or Combatting Junk Mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139-147. Springer, Heidelberg (1993)
6. Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. Cryptology ePrint Archive, Report 2013/796 (2013), http://eprint.iacr.org/
7. Dziembowski, S., Kazana, T., Wichs, D.: One-Time Computable Self-erasing Functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 125-143. Springer, Heidelberg (2011)
8. Fiat, A., Naor, M.: Rigorous time/space trade-offs for inverting functions. SIAM J. Comput. 29(3), 790-803 (1999)
9. Martin, E.: A cryptanalytic time-memory trade-off. IEEE Transactions on Information Theory 26(4), 401-406 (1980)
10. Horowitz, E., Sahni, S.: Computing partitions with applications to the knapsack problem. J. ACM 21(2), 277-292 (1974)
11. Nordstrom, J.: New wine into old wineskins: A survey of some pebbling classics with supplemental results (2011)
12. Paul, W.J., Tarjan, R.E., Celoni, J.R.: Space bounds for a game of graphs. In: Chandra, A.K., Wotschke, D., Friedman, E.P., Harrison, M.A. (eds.) STOC, pp. 149-160. ACM (1976)
13. Perito, D., Tsudik, G.: Secure Code Update for Embedded Devices via Proofs of Secure Erasure. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol. 6345, pp. 643-662. Springer, Heidelberg (2010)
14. Smith, A., Zhang, Y.: Near-linear time, leakage-resilient key evolution schemes from expander graphs. Cryptology ePrint Archive, Report 2013/864 (2013), http://eprint.iacr.org/