When was hash chain first used?Verifying the integrity of ciphertext using the cleartext hash?Can the hash of one message be used to make it easier to find the hash of a very similar message?Tamper-evident audit logsWho first published the interest of more than two prime factors in RSA?Why hash function are used in digital signatures?Prevent hash collisions with HMAC secret as IVComparing the first 50 bits of a hash Vs. the last 50 bits of hashWho issued the first SSL certificate?When was a RSA Private Key Introduced?What was the first hash and what problem was it supposed to solve?
Can I create an upright 7-foot × 5-foot wall with the Minor Illusion spell?
Why are on-board computers allowed to change controls without notifying the pilots?
Why are all the doors on Ferenginar (the Ferengi home world) far shorter than the average Ferengi?
What is the term when two people sing in harmony, but they aren't singing the same notes?
Why is delta-v is the most useful quantity for planning space travel?
Perfect riffle shuffles
Greatest common substring
How to check participants in at events?
Would it be legal for a US State to ban exports of a natural resource?
How to prevent YouTube from showing already watched videos?
Should my PhD thesis be submitted under my legal name?
Partial sums of primes
node command while defining a coordinate in TikZ
Simple image editor tool to draw a simple box/rectangle in an existing image
The most efficient algorithm to find all possible integer pairs which sum to a given integer
What to do when my ideas aren't chosen, when I strongly disagree with the chosen solution?
How to deal with or prevent idle in the test team?
Books on the History of math research at European universities
Is it okay / does it make sense for another player to join a running game of Munchkin?
Resetting two CD4017 counters simultaneously, only one resets
Meta programming: Declare a new struct on the fly
Is there an wasy way to program in Tikz something like the one in the image?
How will losing mobility of one hand affect my career as a programmer?
Have I saved too much for retirement so far?
When was hash chain first used?
Verifying the integrity of ciphertext using the cleartext hash?Can the hash of one message be used to make it easier to find the hash of a very similar message?Tamper-evident audit logsWho first published the interest of more than two prime factors in RSA?Why hash function are used in digital signatures?Prevent hash collisions with HMAC secret as IVComparing the first 50 bits of a hash Vs. the last 50 bits of hashWho issued the first SSL certificate?When was a RSA Private Key Introduced?What was the first hash and what problem was it supposed to solve?
$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
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$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
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
ConnorConnor
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 5 hours ago
ConnorConnor
111
asked 5 hours ago
ConnorConnor
111
111
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Connor is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
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.
answered 4 hours ago
kodlukodlu
9,13811331
$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
4 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.
answered 4 hours ago
kodlukodlu
9,13811331
$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
4 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.
answered 4 hours ago
kodlukodlu
9,13811331
$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
4 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.
answered 4 hours ago
kodlukodlu
9,13811331
$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.
answered 4 hours ago
kodlukodlu
9,13811331
edited 3 hours ago
answered 4 hours ago
kodlukodlu
9,13811331
answered 4 hours ago
kodlukodlu
9,13811331
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
4 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
4 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
4 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
4 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
