One-Way Cross-Trees and Their Applications
This paper considers the problem of efficiently generating a sequence of secrets with the special property that the knowledge of one or several secrets does not help an adversary to find the other ones. This is achieved through one-way cross-trees, which may be seen as a multidimensional extension of the so-called one-way chains. In a dual way, some applications require the release of one or several secrets; oneway cross-trees allow to minimize the amount of data necessary to recover those secrets and only those ones.
- 1.FIPS 180-1. Secure hash standard. Federal Information Processing Standards Publication 180-1, NIST, U.S. Department of Commerce, April 1995.Google Scholar
- 2.R. Anderson, H. Manifavas, and C. Sutherland. A practical electronic cash system. Available from URL 〈http://www.cl.cam.ac.uk/users/rja14/〉, 1995.
- 3.N. Asokan, G. Tsudik, and M. Waidner. Server-supported signatures. In E. Bertino, editor, Fourth European Symposium on Research in Computer Security (ESORICS’ 96), volume 1146 of Lecture Notes in Computer Science, pages 131–143. Springer-Verlag, 1996.Google Scholar
- 4.D. Bleichenbacher and U.M. Maurer. Directed acyclic graphs, one-way functions and digital signatures. In Y.G. Desmedt, editor, Advances in Cryptology —CRYPTO’94, volume 839 of Lecture Notes in Computer Science, pages 75–82. Springer-Verlag, 1994.Google Scholar
- 5.O. Delos and J.-J. Quisquater. An identity-based signature scheme with bounded life-span. In Y.G. Desmedt, editor, Advances in Cryptology — CRYPTO’94, volume 839 of Lecture Notes in Computer Science, pages 83–94. Springer-Verlag, 1994.Google Scholar
- 6.D. de Waleffe and J.-J. Quisquater. Better login protocols for computer networks. In B. Preneel, R. Govaerts, and J. Vandewalle, editors, Computer Security and Industrial Cryptography, volume 741 of Lecture Notes in Computer Science, pages 50–70. Springer-Verlag, 1993.Google Scholar
- 7.S. Even, O. Goldreich, and S. Micali. On-line/off-line digital signatures. In G. Brassard, editor, Advances in Cryptology — CRYPTO’89, volume 435 of Lecture Notes in Computer Science, pages 263–275. Springer-Verlag, 1990.Google Scholar
- 8.N.M. Haller. The S/KEY one-time password system. In Proc. of the ISOC Symposium on Networks andDistribute dSystems Security, 1994.Google Scholar
- 9.L. Lamport. Constructing digital signatures from a one-way function. Technical Report CSL-98, SRI International, 1979.Google Scholar
- 11.M. Mambo, K. Usuda, and E. Okamoto. Proxy signatures for delegating signing operations. In Proc. of the 3rdA CM Conference on Computer andCommunic ations Security, pages 48–57. ACM Press, 1996.Google Scholar
- 12.R.C. Merkle. A digital signature based on a conventional encryption function. In C. Pomerance, editor, Advances in Cryptology — CRYPTO’87, volume 293 of Lecture Notes in Computer Science, pages 369-378. Springer-Verlag, 1988.Google Scholar
- 13.R.C. Merkle. A certified digital signature. In G. Brassard, editor, Advances in Cryptology — CRYPTO’89, volume 435 of Lecture Notes in Computer Science, pages 218–238. Springer-Verlag, 1990.Google Scholar
- 14.M.O. Rabin. Digitalized signatures. In D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 155–168. Academic Press, 1978.Google Scholar
- 15.R. Rivest. The MD5 message digest algorithm. Internet Request for Comments RFC 1321, April 1992. Available at 〈ftp://ds.internic.net/rfc/rfc1321.txt〉.
- 16.R.L. Rivest and A. Shamir. PayWord and MicroMint: two simple micropayment schemes. CryptoBytes, 2 (1), 7–11, 1996.Google Scholar