| Autor: |
Goos, G., Hartmanis, J., Barstow, D., Brauer, W., Brinch Hansen, P., Gries, D., Luckham, D., Moler, C., Pnueli, A., Seegmüller, G., Stoer, J., Wirth, N., Williams, Hugh C., Godlewski, Philippe, Cohen, Gerard D. |
| Zdroj: |
Advances in Cryptology - CRYPTO -- 85 Proceedings; 1986, p458-467, 10p |
| Abstrakt: |
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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
