A Certified Digital Signature

By R. Merkle. 1989

How researchers see this paper

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

Citations in the corpus

Geppetto: Versatile Verifiable Computation (2015, methodology): “Prior work suggested achieving similar properties via Merkle hash trees [8, 12, 27, 29, 43], but implementations show that this approach increases the degree of the QAP by tens or hundreds per state element [9, 16, 54], whereas with MultiQAPs, the degree increases only by 1.”
The Impact of Quantum Computing on Present Cryptography (2018, background): “The first node in the hierarchy of the tree known as root node is the actual public key that can verify the OTSs contained in the leaf nodes [74].”
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks (2002, methodology): “One-way chains are also used in efficient one-time signature algorithms [22, 55, 56, 81], (micro-)payment mechanisms [2, 27, 63, 79], server-supported non-repudiation [3], and for conditional anonymity [28].”
XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions (2011, methodology): “The usage of the bitmasks is the main difference to the other Merkle tree constructions.”
Efficient authentication and signing of multicast streams over lossy channels (2000, background): “Merkle describes how to construct a hash tree over all messages where the signer only digitally signs the root [20, 21].”
Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “number of messages [71], where the state ensures that a one-time signature key from the tree is not reused.”
SecureDAV: a secure data aggregation and verification protocol for sensor networks (2004, methodology): “The integrity of readings is ensured with the help of a Merkle Hash Tree [ 19 ].”
Efficient Arguments without Short PCPs (2007, methodology): “We will also use additional parameters, such as a cryptographic security parameter k, an underlying field F , and a soundness parameter ; for convenience, these parameters can all be thought of as being determined by n.”
Post-quantum cryptography (2008, unknown): “To overcome the problems of large public keys that could be used only once, Merkle proposed [48, 49] to combine 2k public keys into one which can then be used to verify all 2k signatures.”
Physically Observable Cryptography (Extended Abstract) (2004, background): “, [21] and [22]), highlighting once more how old research may play a role in our new context.”
Blockchain in healthcare and health sciences - A scoping review (2019, background): “The transactions in the blocks are formed in a Merkle tree [7] where each leaf value (transaction) can be verified to the known root.”
Proofs of ownership in remote storage systems (2011, background): “Many of these schemes utilize Merkle trees [16] for memory and data authentication.”
Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, unknown): “Merkle Signature Scheme (XMSS) [199] like XMSS-T and SPHINCS [200] are considered promising hash-based signature schemes for the post-quantum era that derive from the Merkle tree scheme described in [201].”
CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles (2018, background): “Merkle [41] firstly proposed Tree Signature as a digital signature authentication.”
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures (2009, methodology): “Using standard techniques, the one-time signature can be transformed into a full-fledged signature scheme using a signature-tree [21,22] with only an additional work factor of O(log n).”
Computationally Sound Proofs (2000, background): “A Merkle tree [27] then is a binary tree whose nodes store (i.”
A Secure System For Pervasive Social Network-Based Healthcare (2016, background): “Each block is a Merkle Tree-based structure [24].”
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying (2002, background): “One-time signatures have found applications in constructions of ordinary signature schemes [Mer87, Mer89], on-line/off-line signature schemes [EGM96], forward-secure signature schemes [ AR00 ], multicast packet authentication [Roh99], among others.”
Quantum technology for military applications (2021, background): “For example, lattice-based cryptography [84], supersingular elliptic curve isogeny cryptography [85], hash-based [86] cryptography , multivariatebased [87] cryptography, code-based cryptography [88] and symmetric key quantum resistance.”