digital signature
A cryptographic proof, generated with a private key, that authenticates the origin and integrity of a message or transaction.
As defined in 13 | Neha Narula on Blockchain, Cryptocurrency, and the Future of the Internet
Where it comes up · 3
- Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie Lamport3 claims
- Margaret Atwood1 claim
- 13 | Neha Narula on Blockchain, Cryptocurrency, and the Future of the Internet1 claim
Most important claims · 5 of 5Search all claims for “digital signature” →
- Lamport's initial Byzantine generals algorithm used digital signatures, which allowed it to tolerate one faulty process with three total processes, whereas algorithms without signatures required four processes—a critical difference for practical systems.Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie Lamport
- The prediction that all books would become e-books proved false; not everything can be digital because digital is screamingly hackable, and many higher-level documents will not accept digital signatures unless a pen-and-ink paper version can also be produced.Margaret Atwood
- Unlike conventional security models that build a perimeter firewall to keep hackers out, Bitcoin has no perimeter—anyone can join at any time, effectively inviting hackers in—but its use of digital signatures and the mining game means hackers cannot spend others' money and are instead incentivized to participate productively rather than attack the system.13 | Neha Narula on Blockchain, Cryptocurrency, and the Future of the Internet
- At the time (1975) Lamport developed his Byzantine algorithm, very few people knew about digital signatures; he learned about them from Whitfield Diffie, a friend, who described the unsolved problem of how to sign messages; Lamport sat down and sketched out the first digital signature algorithm on a napkin.Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie Lamport
- Lamport's initial digital signature algorithm was impractical because it required roughly 128 bits to sign a single bit of data; however, by hashing documents first (using a one-way hash that cannot be forged or reversed), the overhead becomes manageable.Turing Award Winner: Thinking Clearly, Paxos vs Raft, Working With Dijkstra | Leslie Lamport