When was hash chain first used?
$begingroup$
Hash linking is used to prove the integrity of a blockchain, or similar systems. When was that technique first used? I would guess it was early, maybe 1950s/1960s?
hash history
New contributor
$endgroup$
add a comment |
$begingroup$
Hash linking is used to prove the integrity of a blockchain, or similar systems. When was that technique first used? I would guess it was early, maybe 1950s/1960s?
hash history
New contributor
$endgroup$
add a comment |
$begingroup$
Hash linking is used to prove the integrity of a blockchain, or similar systems. When was that technique first used? I would guess it was early, maybe 1950s/1960s?
hash history
New contributor
$endgroup$
Hash linking is used to prove the integrity of a blockchain, or similar systems. When was that technique first used? I would guess it was early, maybe 1950s/1960s?
hash history
hash history
New contributor
New contributor
New contributor
asked 4 hours ago
ConnorConnor
111
111
New contributor
New contributor
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772.
He cites 3 prior papers:
Diffie, W., and Hellman, M.E. New directions in cryptography.
IEEE Trans. Inform. Theory 1T-22 (Nov. 1976), 644-654.Evans, A., Kantrowitz, W., and Weiss, E. A user authentication
scheme not requiring secrecy in the computer. Comm. A CM 17, 8
(Aug. 1974), 437-442.Wilkes, M.V. Time-Sharing Computer Systems. American
Elsevier, New York, 1972.
[1] is the paper which essentially invented Public Key Cryptography in the open literature. Lamport refers to the use of a one way function F, as described there, as hash functions in his chain.
[2] and [3] are cited for "the widespread use of such a function", e.g., storing $y=F(x)$ instead of $x$.
So it seems to me Lamport may well be the first to suggest the use hash chaining.
Edit: Thanks to @Gilles for pointing out Merkle patented hash trees in 1979.
$endgroup$
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "281"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Connor is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f68290%2fwhen-was-hash-chain-first-used%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772.
He cites 3 prior papers:
Diffie, W., and Hellman, M.E. New directions in cryptography.
IEEE Trans. Inform. Theory 1T-22 (Nov. 1976), 644-654.Evans, A., Kantrowitz, W., and Weiss, E. A user authentication
scheme not requiring secrecy in the computer. Comm. A CM 17, 8
(Aug. 1974), 437-442.Wilkes, M.V. Time-Sharing Computer Systems. American
Elsevier, New York, 1972.
[1] is the paper which essentially invented Public Key Cryptography in the open literature. Lamport refers to the use of a one way function F, as described there, as hash functions in his chain.
[2] and [3] are cited for "the widespread use of such a function", e.g., storing $y=F(x)$ instead of $x$.
So it seems to me Lamport may well be the first to suggest the use hash chaining.
Edit: Thanks to @Gilles for pointing out Merkle patented hash trees in 1979.
$endgroup$
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
add a comment |
$begingroup$
Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772.
He cites 3 prior papers:
Diffie, W., and Hellman, M.E. New directions in cryptography.
IEEE Trans. Inform. Theory 1T-22 (Nov. 1976), 644-654.Evans, A., Kantrowitz, W., and Weiss, E. A user authentication
scheme not requiring secrecy in the computer. Comm. A CM 17, 8
(Aug. 1974), 437-442.Wilkes, M.V. Time-Sharing Computer Systems. American
Elsevier, New York, 1972.
[1] is the paper which essentially invented Public Key Cryptography in the open literature. Lamport refers to the use of a one way function F, as described there, as hash functions in his chain.
[2] and [3] are cited for "the widespread use of such a function", e.g., storing $y=F(x)$ instead of $x$.
So it seems to me Lamport may well be the first to suggest the use hash chaining.
Edit: Thanks to @Gilles for pointing out Merkle patented hash trees in 1979.
$endgroup$
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
add a comment |
$begingroup$
Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772.
He cites 3 prior papers:
Diffie, W., and Hellman, M.E. New directions in cryptography.
IEEE Trans. Inform. Theory 1T-22 (Nov. 1976), 644-654.Evans, A., Kantrowitz, W., and Weiss, E. A user authentication
scheme not requiring secrecy in the computer. Comm. A CM 17, 8
(Aug. 1974), 437-442.Wilkes, M.V. Time-Sharing Computer Systems. American
Elsevier, New York, 1972.
[1] is the paper which essentially invented Public Key Cryptography in the open literature. Lamport refers to the use of a one way function F, as described there, as hash functions in his chain.
[2] and [3] are cited for "the widespread use of such a function", e.g., storing $y=F(x)$ instead of $x$.
So it seems to me Lamport may well be the first to suggest the use hash chaining.
Edit: Thanks to @Gilles for pointing out Merkle patented hash trees in 1979.
$endgroup$
Lamport suggested the use of hash chaining in 1981 in Password Authentication with Insecure Communication, Communications of the ACM 24.11 (November 1981), pp 770-772.
He cites 3 prior papers:
Diffie, W., and Hellman, M.E. New directions in cryptography.
IEEE Trans. Inform. Theory 1T-22 (Nov. 1976), 644-654.Evans, A., Kantrowitz, W., and Weiss, E. A user authentication
scheme not requiring secrecy in the computer. Comm. A CM 17, 8
(Aug. 1974), 437-442.Wilkes, M.V. Time-Sharing Computer Systems. American
Elsevier, New York, 1972.
[1] is the paper which essentially invented Public Key Cryptography in the open literature. Lamport refers to the use of a one way function F, as described there, as hash functions in his chain.
[2] and [3] are cited for "the widespread use of such a function", e.g., storing $y=F(x)$ instead of $x$.
So it seems to me Lamport may well be the first to suggest the use hash chaining.
Edit: Thanks to @Gilles for pointing out Merkle patented hash trees in 1979.
edited 3 hours ago
answered 4 hours ago
kodlukodlu
9,13811331
9,13811331
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
add a comment |
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
3
3
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
$begingroup$
Merkle patented hash trees in 1979, and hash chains are a special case of that. I don't know if that special case had been used before.
$endgroup$
– Gilles
3 hours ago
add a comment |
Connor is a new contributor. Be nice, and check out our Code of Conduct.
Connor is a new contributor. Be nice, and check out our Code of Conduct.
Connor is a new contributor. Be nice, and check out our Code of Conduct.
Connor is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Cryptography Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcrypto.stackexchange.com%2fquestions%2f68290%2fwhen-was-hash-chain-first-used%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown