Some Cryptographic Aspects of Womcodes

  • Philippe Godlewski
  • Gerard D. Cohen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 218)


We consider the following crytographic and coding questions in relation with the use of “write-once” memories (or woms)
  • How to prevent anyone from reusing the wom (immutable codes).

  • How to fix the written information in the wom after a given number of generations (locking codes).

  • How to encode a “credit” in a way that guarantees the user t generations or “purchases” in any possible way and makes it impossible to cheat: i.e. writing on the wom necessarily increases the spent amount of money. The coding will be called “incremental locked”.

These questions were only raised in [5], where the accent was put on the generation of womcodes possessing an “easy reading-reserved writing” property.


  1. [1]
    R.L. Rivest and A. Shamir, “How to Reuse a “Write-Once” Memory”, Inform. and Control 55, 1–19(1982).zbMATHCrossRefMathSciNetGoogle Scholar
  2. [2]
    E. Sperner, “Ein Satz uber Untermengen einer endlichen Menge.” (1928), Math. Z. 27. 544–548.CrossRefMathSciNetzbMATHGoogle Scholar
  3. [3]
    G. D. Cohen et A. Lempel, “Linear Intersecting Codes”, To appear in Discrete Mathematics (1985) vol.56(1), pp. 35–43.zbMATHMathSciNetGoogle Scholar
  4. [4]
    A. Fiat et A. Shamir, “Generalized Write-Once Memories”, IEEE Trans. on Inform. Theory, Vol. IT-30, No3, pp. 470–480, may 1984.CrossRefMathSciNetGoogle Scholar
  5. [5]
    G. D. Cohen et P. Godlewski, “Authorized writing for “write-once” memories”, Eurocrypt’85, April 9–11, 1985. To appear in “Springer Lecture Notes in Computer Science”.Google Scholar
  6. [6]
    E.L. Leis, “Data Integrity in Digital Opical Disks”, IEEE Trans. on Computers, vol.C-33, pp. 818–827, September 1984.CrossRefGoogle Scholar
  7. [7]
    T.M. Cover, “Enumerative Source encoding”, IEEE Trans. on Inform. Theory, vol. IT-19, pp. 73–77, January 1973.CrossRefMathSciNetGoogle Scholar
  8. [8]
    J.M. Berger, “A note on Error Detection codes for Asymmetric Channel”, Information and Control 4, pp. 68–73, 1961.CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Philippe Godlewski
    • 1
  • Gerard D. Cohen
    • 1
  1. 1.Département SYCENSTParisFrance

Personalised recommendations