# 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

#### Topics from this paper

#### 330 Citations

Secure distributed paillier key generation with application to the Ordinos e-voting system

- Computer Science
- 2020

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

- 2008

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 are… Expand

Fair Encryption of RSA Keys

- Computer Science
- EUROCRYPT
- 2000

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

- Computer Science
- EUROCRYPT
- 2000

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

- Computer Science
- Symmetry
- 2019

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

- Mathematics, Computer Science
- VoteID
- 2013

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

- Computer Science, Mathematics
- AFRICACRYPT
- 2009

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

- Mathematics, Computer Science
- ACISP
- 2016

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

- Computer Science
- Financial Cryptography
- 2002

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

- Mathematics, Computer Science
- ACISP
- 2009

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

#### References

SHOWING 1-10 OF 30 REFERENCES

A method for obtaining digital signatures and public-key cryptosystems

- Computer Science
- CACM
- 1983

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… Expand

A Secure and Optimally Efficient Multi-Authority Election Scheme

- Mathematics, Computer Science
- EUROCRYPT
- 1997

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 is… Expand

A method for obtaining digital signatures and public-key cryptosystems

- Computer Science
- CACM
- 1978

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

- Computer Science, Mathematics
- EUROCRYPT
- 1998

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

- Political Science
- 1987

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 is… Expand

How to share a function securely

- Computer Science
- STOC '94
- 1994

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

- Computer Science
- Proceedings 38th Annual Symposium on Foundations of Computer Science
- 1997

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

- Mathematics, Computer Science
- CRYPTO
- 1996

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 to… Expand

Robust and Efficient Sharing of RSA Functions

- Computer Science
- Journal of Cryptology
- 2000

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 can… Expand

Robust and E cient Sharing of RSA FunctionsRosario

- 1996

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 to… Expand