Pierre-Alain Fouque, G Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Crypto (FC '00), 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
On Design of RSA Threshold Signature Scheme - Wang, Hui, Chow, Tsang, Chong.. (2001) (Correct)
....the polynomial interpolation. Many threshold RSA signature schemes [8, 9, 11, 16, 24, 26] have been constructed since the first threshold RSA signature [10] was presented. One more efficient RSA threshold signature is given by Shoup [26] From Shoup scheme, a few other threshold public key systems [7, 8, 14] (include threshold signatures and threshold public key encryptions) are also presented. These schemes are more efficient than other threshold RSA versions given before. All the threshold RSA signature schemes also have the disadvantage that they can be broken by the conspiracy attack. Based on ....
P. Fouque, G. Poupard, J. Stern, Sharing Decryption in the Context of Voting or Lotteries, Proceedings of Finacial Crypro 2000.
Distributing the Encryption and Decryption of a Block.. - Martin, Safavi-Naini.. (2003) (Correct)
....has investigated distributing the ability to compute digital signatures. Others, such as [8, 19] have also considered sharing public key decryption. As well as being interesting in their own right, distributed public key primitives have applications to many other areas such as electronic voting [17]. One of the reasons why public key cryptography has almost exclusively been investigated in this regard is that the inherent algebraic structure, and resulting homomorphic properties, behind some public key algorithms (particularly discrete logarithmbased algorithms such as ElGamal) lends itself ....
P.-A. Fouque, G. Poupard and J. Stern. Sharing Decryption in the Context of Voting or Lotteries, Financial Cryptography 2000, Lecture Notes in Computer Science, 1962 (2001) 90--104.
Practical Multi-Candidate Election System - Baudron (2000) (12 citations) Self-citation (Fouque Poupard Stern) (Correct)
No context found.
P. A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Crypto '00, LNCS. Springer-Verlag, 2000.
CryptoComputing with rationals - Fouque, Stern, Wackers (2002) Self-citation (Fouque Stern) (Correct)
....of two encrypted values or multiplication by a known integer. Homomorphic schemes were proposed to solve more eciently the problem of computing with integers under computational assumptions. These special kind of public key cryptosystems have applications in electronic schemes or lotteries [4, 9, 12, 2]. These algorithms can also be used to build ecient multiparty computation protocols with reduced communication complexity [8] Finally, Poupard and Stern used lattices and rationals to build a key recovery system in [18] 1.2 Our Results In this paper, we study a new version of a ....
P. A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Crypto '00, LNCS. Springer-Verlag, 2000.
Fully Distributed Threshold RSA under Standard Assumptions - Fouque, Stern (10 citations) Self-citation (Fouque Stern) (Correct)
....In our work, we consider environments where high security is required such as electronic voting schemes. Therefore, we prefer to use protocols based on standard assumptions. We believe that standard assumptions and security proofs are needed to build secure protocols. Several electronic schemes [14, 11, 1] have been based on Paillier cryptosystem which is related to RSA. The techniques developed in the paper can be used to fully share this cryptosystem. 2.2 Our results We prove that Shoup s protocol can be modified to work with RSA moduli having special properties under standard assumptions and ....
P. A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Crypto '00, LNCS. Springer-Verlag, 2000.
Practical Multi-Candidate Election System - Baudron, Fouque, Pointcheval.. (2001) (12 citations) Self-citation (Fouque Poupard Stern) (Correct)
....an efficient decryption algorithm as well as the largest bandwidth among all cryptosystems using a trapdoor to compute the discrete logarithm. Both of these arguments are the main components to design multi candidate election schemes and finally a threshold version of this cryptosystem appeared in [15] and was rediscovered independently but later in [11] In this last paper, the authors have a new and original point of view on Paillier scheme and provide another threshold version. They apply this sharing scheme to a multi candidate voting scheme as we made but with a different cryptographic ....
P. A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Crypto '00, LNCS. Springer-Verlag, 2000.
Improved Efficiency for Private Stable Matching - Matthew Franklin Mark (2006) (Correct)
No context found.
Pierre-Alain Fouque, G Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Crypto (FC '00), 2000.
The Vector-Ballot E-Voting Approach - Aggelos Kiayias And (2004) (3 citations) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard and Jacques Stern, Sharing Decryption in the Context of Voting or Lotteries, Financial Cryptography 2000.
Trapdooring Discrete Logarithms on Elliptic - Curves Over Rings (Correct)
No context found.
P-A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of of Voting or Lotteries. In Proceedings of Financial Cryptography '00, LNCS, SpringerVerlag, 2000.
Obfuscated Ciphertext Mixing - Adida, Wikström (2005) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In FC '00: Proceedings of the 4th International Conference on Financial Cryptography, pages 90--104, London, UK, 2001. Springer-Verlag.
GBD Threshold Cryptography with an Application to RSA.. - Steketee, Brown.. (2005) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Stern Stern. Sharing decryption in the context of voting or lotteries. In FC '00: Proceedings of the 4th International Conference on Financial Cryptography, volume 1962, pages 90--104. Springer-Verlag, 2001.
Trapdooring Discrete Logarithms on Elliptic - Curves Over Rings (Correct)
No context found.
P-A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of of Voting or Lotteries. In Proceedings of Financial Cryptography '00, LNCS, SpringerVerlag, 2000.
Reconciling Cooperation with Confidentiality in.. - Machiraju, Katz (2004) (Correct)
No context found.
P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. Lecture Notes in Computer Science, 1962.
Event Driven Private Counters - Eu-Jin Goh Philippe (Correct)
No context found.
P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Y. Frankel, editor, Proceedings of Financial Cryptography 2000, volume 1962 of LNCS, pages 90--104, 2000.
An Asynchronous Multi-Party Computation Protocol - Martin Hirt Hirt (2004) (Correct)
No context found.
Pierre-Alain Fouque, Gouillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptography '00, Lecture Notes in Computer Science, 2000.
Trapdooring Discrete Logarithms on Elliptic Curves over Rings - Paillier (2000) (7 citations) (Correct)
No context found.
P-A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of of Voting or Lotteries. In Proceedings of Financial Cryptography '00, LNCS, SpringerVerlag, 2000.
A Survey Of Algebraic Properties Used In Cryptographic.. - Cortier, Delaune.. (2004) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. Lecture Notes in Computer Science, 2000.
Batch Verification for Equality of Discrete.. - Aditya, Peng, Boyd.. (2004) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptology---FC 00, pages 90--104, 2000.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Crypto 2000, 2000.
Trapdooring Discrete Logarithms on Elliptic Curves over Rings - Paillier (2000) (7 citations) (Correct)
No context found.
P-A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of of Voting or Lotteries. In Proceedings of Financial Cryptography '00, LNCS, SpringerVerlag, 2000.
Receipt-Free Homomorphic Elections and Write-in Ballots - Acquisti (2004) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Cryptography '00. Springer-Verlag, 2000. 16
Electronic Voting Schemes - Rjaskova (2002) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. Financial Cryptography 2000, LNCS, Springer-Verlag, 2000.
The Vector-Ballot E-Voting Approach - Kiayias, Yung (2004) (3 citations) (Correct)
No context found.
Pierre-Alain Fouque, Guillaume Poupard and Jacques Stern, Sharing Decryption in the Context of Voting or Lotteries, Financial Cryptography 2000.
Trapdooring Discrete Logarithms on Elliptic Curves over Rings - Paillier (2000) (7 citations) (Correct)
No context found.
P-A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of of Voting or Lotteries. In Proceedings of Financial Cryptography '00, LNCS, SpringerVerlag, 2000.
Efficient and Secure Multi-Party Computation with Faulty.. - Garay, MacKenzie, Yang (2004) (Correct)
No context found.
P. Fouque, G .Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Crypto 2000.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC