Sharing Decryption in the Context of Voting or Lotteries

@inproceedings{Fouque2000SharingDI,
  title={Sharing Decryption in the Context of Voting or Lotteries},
  author={Pierre-Alain Fouque and Guillaume Poupard and Jacques Stern},
  booktitle={Financial Cryptography},
  year={2000}
}
Several public key cryptosystems with additional homomorphic properties have been proposed so far. They allow to perform computation with encrypted data without the knowledge of any secret information. In many applications, the ability to perform decryption, i.e. the knowledge of the secret key, gives a huge power. A classical way to reduce the trust in such a secret owner, and consequently to increase the security, is to share the secret between many entities in such a way that cooperation… Expand
Secure distributed paillier key generation with application to the Ordinos e-voting system
TLDR
This is the first time that an approach with security against malicious parties was implemented and evaluated of Ordinos, a novel verifiable tally-hiding e-voting system based on a threshold variant of the Paillier encryption scheme and two MPC protocols for the comparison of encrypted numbers. Expand
Threshold Cryptography Based on Blakley Secret Sharing
Function sharing deals with the problem of distribution of the computation of a function (such as decryption or signature) among several parties. The necessary values for the computation areExpand
Fair Encryption of RSA Keys
TLDR
This paper considers an optimistic scenario in which users have pairs of public and private keys and give an encryption of their secret key with the public key of a third party, and proposes proofs of fair encryption for El Gamal and RSA keys, using the Paillier cryptosystem. Expand
Multiparty Computation from Threshold Homomorphic Encryption
TLDR
It is shown that given keys for any sufficiently efficient system of this type, general MPC protocols for n parties can be devised which are secure against an active adversary that corrupts any minority of the parties. Expand
An Information Theoretically Secure E-Lottery Scheme Based on Symmetric Bivariate Polynomials
TLDR
This paper introduces a novel e-lottery scheme that achieves information theoretical security, designed using symmetric bivariate polynomials, and it satisfies the required security properties, such as correctness, unpredictability, verifiability, and robustness. Expand
Towards a Practical Cryptographic Voting Scheme Based on Malleable Proofs
TLDR
A multi-party computation protocol is adapted to build a distributed key generation protocol for the encryption scheme underlying their voting scheme, resulting in a cryptographic voting scheme that concludes that the replacement of postal voting by cryptographic voting based on malleable proofs is feasible on an electoral district level. Expand
Practical Threshold Signatures with Linear Secret Sharing Schemes
TLDR
This paper investigates how threshold cryptography can be conducted with any linear secret sharing scheme and presents a function sharing scheme for the RSA cryptosystem, a generalization of Shoup's Shamir-based scheme that is similarly robust and provably secure under the static adversary model. Expand
Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry
TLDR
This work renovates the threshold Paillier cryptosystem using a different mathematical structure, and enjoys some additional benefits: 1 the proposed method avoids the technical obstacle of computing inverses in the group whose order is unknown; 2 it gains computational advantages over Shoup's trick and it can be used as a general building block to design secure and efficient threshold cryptos System based on factoring. Expand
CryptoComputing with Rationals
TLDR
A method to compute with encrypted rational numbers using the Paillier cryptosystem which offers the largest bandwidth among all homomorphic schemes and uses two-dimensional lattices to recover the numerator and denominator of the rationals. Expand
Fair Threshold Decryption with Semi-Trusted Third Parties
TLDR
This paper presents fair threshold decryption schemes, where either all of the participants can decrypt or none of them can, and considers a number of variants of these schemes to address realistic alternative trust scenarios. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 30 REFERENCES
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 importantExpand
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the performance isExpand
A method for obtaining digital signatures and public-key cryptosystems
TLDR
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys. Expand
A New Public-Key Cryptosystem as Secure as Factoring
TLDR
This paper proposes a novel public-key cryptosystem, which is practical, provably secure and has some other interesting properties as follows: It can be proven to be as secure as the intractability of factoring n = p2q (in the sense of the security of the whole plaintext) against passive adversaries. Expand
Verifiable secret-ballot elections
Privacy in secret-ballot elections has traditionally been attained by using a ballot box or voting booth to disassociate voters from ballots. Although such a system might achieve privacy, there isExpand
How to share a function securely
TLDR
The primitive of function sharing is defined, a functional analog of secret sharing, and employed to construct novel cryptosystems with improved integrity, availability and security properties and should be contrasted with the model of secure function evaluation protocols. Expand
Optimal-resilience proactive public-key cryptosystems
TLDR
A threshold function sharing scheme with proactive security for general functions with a "homomorphic property" (a class which includes all RSA variants and Discrete logarithm variants) and enables computation of the function by the servers assuring high availability, security and efficiency. Expand
Robust and Efficient Sharing of RSA Functions
We present two efficient protocols which implement robust threshold RSA signature schemes, where the power to sign is shared by N players such that any subset of T or more signers can collaborate toExpand
Robust and Efficient Sharing of RSA Functions
Abstract. We present two efficient protocols which implement robust threshold RSA signature schemes, where the power to sign is shared by N players such that any subset of T+1 or more signers canExpand
Robust and E cient Sharing of RSA FunctionsRosario
We present two eecient protocols which implement robust threshold RSA signature schemes, where the power to sign is shared by N players such that any subset of T or more signers can collaborate toExpand
...
1
2
3
...