Some Cryptographic Aspects of Womcodes

2Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Godlewski, P., & Cohen, G. D. (1986). Some Cryptographic Aspects of Womcodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 218 LNCS, pp. 458–467). Springer Verlag. https://doi.org/10.1007/3-540-39799-X_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free