Published in

Springer, Lecture Notes in Computer Science, p. 346-356, 2002

DOI: 10.1007/3-540-45664-3_25

Links

Tools

Export citation

Search in Google Scholar

One-Way Cross-Trees and Their Applications.

Journal article published in 2002 by Marc Joye, Sung-Ming Yen
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Red circle
Preprint: archiving forbidden
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

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.