• Corpus ID: 210929339

Threshold Cryptography with Tendermint Core

@inproceedings{Froidevaux2020ThresholdCW,
  title={Threshold Cryptography with Tendermint Core},
  author={Nathalie Froidevaux},
  year={2020}
}
Threshold cryptography provides protocols and techniques for building secure distributed systems and services that perform cryptographic operations while tolerating multiple faults and security breaches occurring at the same time. Threshold cryptosystems are operated by multiple parties which execute the cryptographic operations in collaboration and maintain privacy, availability and correctness even in the presence of some corrupted parties. The emergence and rise of blockchain technologies… 

References

SHOWING 1-10 OF 10 REFERENCES
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
TLDR
This paper shows that a widely used dlog-based DKG protocol suggested by Pedersen does not guarantee a uniformly random distribution of generated keys, and presents a new protocol which proves to satisfy the security requirements from DKG protocols and ensures a uniform distribution of the generated keys.
Proactive Security: Long-term protection against break-ins
TLDR
This work describes the proactive approach to security, elaborate on two of the most important results: proactive signatures and proactive secure communication, and reviews some algorithms, implementations, and applications.
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
TLDR
In order to guarantee the availability and integrity of the secret, this work provides mechanisms to detect maliciously (or accidentally) corrupted shares, as well as mechanisms to secretly recover the correct shares when modification is detected.
Practical byzantine fault tolerance and proactive recovery
TLDR
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS.
Reaching Agreement in the Presence of Faults
TLDR
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.
How to share a secret
  • A. Shamir
  • Computer Science, Mathematics
    CACM
  • 1979
TLDR
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
The Byzantine Generals Problem
TLDR
It is shown that, using only oral messages, the problem of a group of generals camped with their troops around an enemy city is solvable if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Implementing fault-tolerant services using the state machine approach: a tutorial
TLDR
The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
Platform for robust threshold cryptography.
  • https://csrc.nist.gov/
  • 2019