A Digital Signature Based on a Conventional Encryption Function

By R. Merkle. 1987

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

Honeycrisp: large-scale differentially private aggregation without a trusted core (2019, background): “Devices can check that an item is in the set by asking A to sending a membership proof for the item which consists of ⌈logN ⌉ + 1 hashes from the Merkle tree [57].”
Verifying computations with state (2013, methodology): “V and P convert each query into C code that invokes the APIs from Sections 3.2 and 5.2, and is then compiled into constraints.”
Distributed detection of node replication attacks in sensor networks (2005, methodology): “For example, we could use the Merkle-Winternitz signature [25], which has already been successfully used for stream signatures [31].”
Verifying computations without reexecuting them (2015, background): “In Pantry’s approach—which instantiates folklore techniques [6, 10, 25, 33]— the verifier’s explicit input includes a digest (for example, a Merkle hash [13, 41]) of the full input or state, and the prover is obliged to”
SmBoP: Semi-autoregressive Bottom-up Semantic Parsing (2020, methodology): “First, during preprocessing, for every height t , we compute the gold hashes h gold t , the hash values of every sub-tree of z gold of height t , in a recursive fashion using a Merkle tree hash (Merkle, 1987).”
Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation (2019, methodology): “In the third benchmark, P proves to V that it knows the value of the leaves of a Merkle tree [41] that computes to a public root value [16].”
Secure Signature-Based Authenticated Key Establishment Scheme for Future IoT Applications (2017, background): “However, long signature and key lengths as used in [27], [28], [29] make these suitable only for applications that send messages infrequently.”
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash (2010, background): “In addition to these cryptographic primitives, our library also makes uses of hash functions (both universal one-way hashes [62] and Merkle hashes [61]), digital signatures [49], pseudo-random functions [46], and symmetric encryption [34].”
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains (2019, background): “The simplest accumulator is the Merkle tree [Mer88], but several other accumulators are known, as discussed below.”
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks (2002, methodology): “One-way chains re 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].”
A Survey about Consensus Algorithms Used in Blockchain (2018, background): “• Tx_Root: this field, which is also known as the Merkle root [24], contains the hash value of all validated transactions of the block.”
Fast and secure distributed read-only file system (2000, methodology): “Merkle used a hierarchy of hashes for an ef.cient digital signature scheme [Merkle 1987].”
Ancile: Privacy-Preserving Framework for Access Control and Interoperability of Electronic Health Records Using Blockchain Technology (2018, background): “A Merkle Tree is constructed as a binary tree, the base of the tree containing the data while each parent node is the hash of its two children (Merkle, 1987).”
Secure Untrusted Data Repository (SUNDR) (2004, methodology): “First, all files writable by a particular user or group are efficiently aggregated into a single hash value called the i-handleusinghash trees[18].”
SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions (2015, methodology): “This scheme will facilitate the future development of tree hashing [7] variants, in which parallel processing can be applied to compute and update digests of long messages more efficiently.”
Blockchain-Based Dynamic Key Management for Heterogeneous Intelligent Transportation Systems (2017, background): “All the transactions in the block are merged into the Merkle tree root [41].”