On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Password authentication with insecure communication
Communications of the ACM
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Directed Acyclic Graphs, One-way Functions and Digital Signatures
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
An Identity-Based Signature Scheme with Bounded Life-Span
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Better Login Protocols for Computer Networks
Computer Security and Industrial Cryptography - State of the Art and Evolution, ESAT Course
Hash-Based Key Management Schemes for MPEG4-FGS
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
A key derivation scheme for hierarchical access control to JPEG 2000 coded images
PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part II
| Hi-index | 0.00 |
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.