Skip to search formSkip to main contentSkip to account menu

Threshold cryptosystem

Known as: Threshold, Threshold encryption 
In cryptography, a cryptosystem is called a "threshold cryptosystem", if in order to decrypt an encrypted message, several parties (more than some… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Access structureBroadcast encryptionCertificate authorityCiphertext

Broader (1)

Public-key cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Helix: A Scalable and Fair Consensus Algorithm Resistant to Ordering Manipulation
We present Helix, a Byzantine fault tolerant and scalable consensus algorithm for fair ordering of transactions among nodes in a… 
2018
2018
Helix : A Scalable and Fair Consensus Algorithm
We present Helix, a Byzantine fault tolerant and scalable consensus algorithm for fair ordering of transactions among nodes in a… 
2011
2011
Multifactor hierarchical fuzzy trust evaluation on peer-to-peer networks
Decentralized Peer-to-Peer (P2P) networks offer not only opportunities but also threats. Due to the autonomy, self-interest and… 
2010
2010
Analysis and Improvements over DoS Attacks against IEEE 802.11i Standard
To improve the ability of system providing service when encounter malicious invasion, a new model of tolerance invasion system is… 
2008
2008
Civitas: Implementation of a Threshold Cryptosystem
This paper describes the implementation of a threshold cryptosystem for Civitas, a secure electronic voting system. The… 
2006
2006
Modified ID-Based Threshold Decryption and Its Application to Mediated ID-Based Encryption
Chai, Cao and Lu first proposed an ID-based threshold decryption scheme without random oracles. Their approach is based on the… 
2005
2005
Distributing the Encryption and Decryption of a Block Cipher
In threshold cryptography, the goal is to distribute the computation of basic cryptographic primitives across a number of nodes… 
2005
2005
Privacy Preserving Link Analysis on Dynamic Weighted Graph
Link analysis algorithms have been used successfully on hyperlinked data to identify authoritative documents and retrieve other… 
2002
2002
Cryptanalysis of the Lee-Hwang Group-Oriented Undeniable Signature Schemes
Undeniable signature is an intriguing concept introduced by Chaum and Antwerpen at Crypto’89. In 1999, Lee and Hwang presented… 
1998
1998
A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group
In this paper, we show an efficient (k,n) threshold secret sharing scheme over any finite Abelian group such that the size of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)