Optimal Tree-Based One-Time Digital Signature Schemes
نویسندگان
چکیده
A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be deened: U V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of eecient cryptographic digital signature schemes, the problem of constructing trees with a large number of pairwise incomparable minimal cutsets or, equivalently, with a large antichain in the poset of minimal cutsets, is considered.
منابع مشابه
Optimal Tree-based One-time Digital Signatures Schemes
A minimal cutset of a tree directed from the leaves to the root is a minimal set of vertices such that every path from a leaf to the root meets at least one of these vertices. An order relation on the set of minmal cutsets can be deened: U V if and only if every vertex of U is on the path from some vertex in V to the root. Motivated by the design of eecient cryptographic digital signature schem...
متن کاملPractical forward secure signatures using minimal security assumptions
Digital signatures are one of the most important cryptographic primitives in practice. They are an enabling technology for eCommerce and eGovernment applications and they are used to distribute software updates over the Internet in a secure way. In this work we introduce two new digital signature schemes: XMSS and its extension XMSS . We present security proofs for both schemes in the standard ...
متن کاملFail-Stop Signatures Without Trees
We construct the first fail-stop signature scheme where neither the signature length nor the length of the public key grows as a function of the number of messages that can be signed with one key. The computation needed for signing and testing is reduced similarly. This removes one of the main differences between the complexity of ordinary signature schemes and previous fail-stop signature sche...
متن کاملOptimal Parameters for XMSS
We introduce Multi Tree XMSS (XMSS ), a hash-based signature scheme that can be used to sign a virtually unlimited number of messages. It is provably forward and hence EU-CMA secure in the standard model and improves key and signature generation times compared to previous schemes. XMSS has — like all practical hash-based signature schemes — a lot of parameters that control different trade-offs ...
متن کاملOn the E ciency of One - time Digital
Digital signature schemes based on a general one-way function without trapdoor ooer two potential advantages over digital signature schemes based on trapdoor one-way functions such as the RSA system: higher eeciency and much more freedom in choosing a cryptographic function to base the security on. Such a scheme is characterized by a directed acyclic computation graph and an antichain in a cert...
متن کامل