Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying

By Leonid Reyzin, Natan Reyzin. Australasian Conference on Information Security and Privacy, 2002

343 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/e431d5aab6b7fc9f1562eb2c5d17bcbfe2e0cab4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Networks and Communications

Citations in the corpus

Permacoin: Repurposing Bitcoin Work for Data Preservation (2014, methodology): “, those based on Merkle signatures [15]), since we require a special non-outsourceable property.”
SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks (2002, methodology): “Any efficient broadcast authentication mechanism, such as TESLA [34], HORS [39], or TIK [35], can be used to authenticate the neighbor.”
Cyber security in the Smart Grid: Survey and challenges (2013, methodology): “To mitigate the limitation of OTS, researchers relaxed the constraint of ''one-timed-ness'' to ''n-timed-ness'' and developed the scheme of hash to obtain random subsets (HORS) [115], which is considered as one of the fastest cryptographic primitives to date in signature generation and verification.”
Rushing attacks and defense in wireless ad hoc network routing protocols (2003, neutral): “[38] Leonid Reyzin and Natan Reyzin.”
A survey on the communication architectures in smart grid (2011, neutral): “In the third scenario, GOOSE/SMV messages are authenticated by using three algorithms: RSA [113], HORS [114,115] and HMAC [116,117].”
The SPHINCS+ Signature Framework (2019, background): “The idea for itsr is that from a theoretical point of view, one can think of the 2h FORS instances as a single huge HORS-style [42] signature scheme.”
SPHINCS: Practical Stateless Hash-Based Signatures (2015, methodology): “HORST improves HORS [34] using a binary hash-tree to reduce the public key size from tn bits to n bits5 and the combined signature and public key size from tn bits to (k(τ − x + 1) + 2)n bits for some x ∈ N\{0}.”
A ciphertext-policy attribute-based encryption scheme with constant ciphertext length (2009, methodology): “’s HORS (Hash to Obtain Random Subset) scheme [26] is recommended as a one-time signature scheme to convert a strong one-time signature scheme.”