Masayuki Abe. Universally verifiable mix-net with verification work indendent of the number of mix-servers. In proceedings of EUROCRYPT '98, LNCS series, volume 1403, pages 437--447, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Anonymous Statistical Survey of Attributes - Toru Nakanishi And (2001) (Correct)
....values, this system introduces an attribute authority as the additional TTP. The attribute authority assures the correspondence between the user s genuine attribute values and the committed values. In the proposed system, extensions of the group signature scheme [2] verifiable shu#e protocols [3] and the threshold cryptosystem [4] produce the correctness along with the anonymity. This paper is organized as follows: Section 2 shows a model of the anonymous statistical survey system of attributes. Next, as the cryptographic tools used in the proposed system, signatures based on ....
..... c # N ) satisfying Dec(c j ) Dec(c # #(j) for all j, where Dec is the decryption function and # is a permutation. Furthermore, it is infeasible to determine #(j) for any j with non negligibly better probability unless the parties cooperate, since the permuted ciphertexts are randomized. In [3], a shu#e protocol of the ElGamal encryption is proposed for constructing the Mix net. Since the parties may disobey the shu#e, the shu#e should be verifiable, which is brought by the parties proving the correctness of their actions without revealing their random factors. In [3] a PK to prove the ....
[Article contains additional citation context not shown here]
Abe, M.: Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers, Advances in Cryptology --- EUROCRYPT'98 , LNCS 1403, Springer--Verlag, pp. 437--447 (1998).
Receipt-Free Electronic Voting Scheme with a Tamper-Resistant.. - Lee, Kim (2002) (4 citations) (Correct)
....that also satisfy universal verifiability. Electronic voting schemes found in the literature can be classified by their approaches into the following three categories: Schemes using blind signature: Cha88] FOO92] OMAFO99] Schemes using mix net: PIK93] SK95] Pfi94] MH96] [Abe98], Jak98] HS00] Hirt01] MBC01] Schemes using homomorphic encryption: Ben87] SK94] CFSY96] CGS97] LK00] Hirt01] BFPPS01] Cha02] Po00] Voting schemes based on blind signature technique are simple, e#cient, and flexible, but they cannot provide receipt freeness. Voter s ....
M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers", Advances in Cryptology -- Eurocrypt'98, LNCS Vol.1403, pages 437--447, Springer-Verlag, 1998.
Universal Re-encryption for Mixnets - Golle, Jakobsson, Juels, Syverson (2002) (16 citations) (Correct)
....[6, 29] a variety of schemes and properties have been introduced. One of the most relevant properties for a mix network is that of correctness, namely the assurance that inputs are not tampered with by servers so as to alter their underlying plaintexts. Correctness may be universally verifiable [27, 2, 1, 19, 26, 14, 22] meaning that the correctness of the output with respect to the input may be checked by any player, whether or not a participant in the mixing process. Alternatively, the correctness guarantees may rely on honest behavior by a majority of mix servers. Examples of this type of robustness can be ....
....on ElGamal. Let us consider a universal cryptosystem construction based on the ElGamal cryptosystem. The core idea is conceptually simple. Let E[m] loosely denote ElGamal encryption a plaintext m (under some key) In a universal cryptosystem, a ciphertexts on message m consists of a pair [E[m] E[1]] ElGamal possesses a homomorphic property, namely that E[a] Theta E[b] E[ab] for group operator Theta. Thanks to this property, the second component can be used to re encrypt the first without knowledge of the associated public key. To provide more detail, let G denote the underlying group ....
[Article contains additional citation context not shown here]
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 437--447. Springer-Verlag, 1998.
Oblivious Counter and Majority Protocol - Kikuchi (2002) (Correct)
....who involve at the end of the protocol in order to jointly decrypt the tally. The most suitable application of oblivious counter is to an electronic voting, in which we have two conflicting goals; the privacy of votes and the accountability of parties. For requirements and styles of voting, see [1]. So far, major e#orts have been made for universally and publicly verifiable Mix net. The oblivious counter can match the requirements, i.e. each voter can casts a ciphertext of his her private vote to the oblivious counter without care of the private vote being compromised or discarded. The ....
....homomorphism of El Gamal cryptosystem, the function EXORing of two plaintexts, a and b, is easily implemented by simply multiplying the ciphertexts A and B. Table 1 demonstrates the result of multiplication, which shows the truth table of EXOR. Table 1. Truth Table of EXOR AB = S a b = s E[1] = E[1] 0 0 = 0 E[ 1] E[ 1] 0 1 = 1 E[1] E[ 1] 1 0 = 1 E[ 1] E[1] 1 1 = 0 The carry c (AND) is, however, hard to realize since the set of logical operations EXOR and negation, which is done by EXORing 1, is not su#cient for achieving the functionally completeness. The ....
[Article contains additional citation context not shown here]
M. Abe, "Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers," IEICE Trans. Fundamentals, Vol. E83-A, No.7, July 2000.
The Free Haven Project: Distributed Anonymous Storage.. - Dingledine, Freedman.. (2000) (112 citations) (Correct)
.... communication channels are Onion Routing[47] and Zero Knowledge Systems Freedom[18] We refer to David Martin s thesis for a comprehensive overview of anonymous channels in theory and practice[32] The design and implementation of an anonymous communication channel is an ongoing research topic [1, 6, 8, 9, 22, 24, 25, 28, 38, 41]. The first implementation of the Free Haven design will use the Cypherpunk and Mixmaster remailers as its anonymous channel. For design details, see [16] 3.9 Reputation System The reputation system in Free Haven is responsible for creating accountability. Accountability in a system so ....
Masayuki Abe. Universally verifiable mix-net with verification work independent of the number of servers. In Advances in Cryptology -- EUROCRYPT '98, pages 437--447.
A Verifiable Secret Shuffle of Homomorphic Encryptions - Jens Groth Department (2005) (Correct)
No context found.
Masayuki Abe. Universally verifiable mix-net with verification work indendent of the number of mix-servers. In proceedings of EUROCRYPT '98, LNCS series, volume 1403, pages 437--447, 1998.
Mix-based Electronic Payments - Published In Tavares (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers," Eurocrypt '98.
Mix-based Electronic Payments - Published In Tavares (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers," Eurocrypt '98.
A Sender Verifiable Mix-Net and a New Proof of a Shuffle - Wikström (2005) (Correct)
No context found.
M. Abe, Universally Verifiable mix-net with Verification Work Independent of the Number of Mix-centers, Eurocrypt '98, pp. 437-447, LNCS 1403, 1998.
Mix-based Electronic Payments - Jakobsson, M'Raïhi (1999) (13 citations) (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers," Eurocrypt '98.
Making Mix Nets Robust for Electronic Voting by.. - Jakobsson, Juels, Rivest (16 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 437--447. Springer-Verlag, 1998.
Providing Receipt-freeness in Mixnet-based Voting.. - Lee, Boyd, Dawson, Kim.. (2003) (Correct)
No context found.
M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers", Advances in Cryptology -- Eurocrypt'98, LNCS 1403, Springer-Verlag, pp. 437--447, 1998.
Receipt-free Electronic Voting through - Collaboration Of Voter (2000) (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-servers", In Advances in Cryptology -- Eurocrypt 98, LNCS Vol. 1403, Springer-Verlag, pp. 437--447, 1998.
Secure Mobile Gambling - Markus Jakobsson David (2001) (1 citation) (Correct)
No context found.
M. Abe. Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers. In Eurocrypt '98, LNCS 1403, pages 437--447. SpringerVerlag, Berlin, 1998.
Making Mix Nets Robust for Electronic Voting by.. - Jakobsson, Juels, Rivest (16 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 437--447. Springer-Verlag, 1998.
Making Mix Nets Robust for Electronic Voting by.. - Jakobsson, Juels, Rivest (16 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 437--447. Springer-Verlag, 1998.
Receipt-Free Homomorphic Elections and Write-in Ballots - Acquisti (2004) (Correct)
No context found.
Masayuki Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In EUROCRYPT '98, pages 437--447. Springer-Verlag, LNCS 1403, 1998.
Providing Receipt-freeness in Mixnet-based Voting.. - Lee, Boyd, Dawson, Kim.. (2003) (Correct)
No context found.
M. Abe, "Universally verifiable mix-net with verification work independent of the number of mix-servers", Advances in Cryptology -- Eurocrypt'98, LNCS 1403, Springer-Verlag, pp. 437--447, 1998.
Making Mix Nets Robust for Electronic Voting by.. - Jakobsson, Juels, Rivest (2002) (16 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, volume 1403 of Lecture Notes in Computer Science, pages 437--447. SpringerVerlag, 1998.
Mix-based Electronic Payments - Published In Tavares (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers," Eurocrypt '98.
Almost Entirely Correct Mixing with Applications to Voting - Boneh, Golle (2002) (7 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In Proc. of Eurocrypt '98, pp. 437-447. Springer-Verlag, 1998. LNCS 1403.
Almost Entirely Correct Mixing with Applications to Voting - Boneh, Golle (2002) (7 citations) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In Proc. of Eurocrypt '98, pp. 437-447. Springer-Verlag, 1998. LNCS 1403.
Breaking and Mending Resilient Mix-nets - Nguyen, Safavi-Naini (2003) (Correct)
No context found.
M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In K. Nyberg, editor, EUROCRYPT '98, pages 437-447. Springer-Verlag, 1998. LNCS No. 1403.
Mix-based Electronic Payments - Published In Tavares (Correct)
No context found.
M. Abe, "Universally Verifiable Mix-net with Verification Work Independent of the Number of Mix-centers," Eurocrypt '98.
Uncoercible e-Bidding Games - Burmester, Magkos, Chrissikopoulos (2004) (Correct)
No context found.
Abe, M. (1998). "Universally Verifiable Mix-Net with Verification Work Independent of the Number of Mix-Servers." In Advances in Cryptology---EUROCRYPT '98, Lecture Notes in Computer Science, Vol. 1403. Berlin: Springer, pp. 437--447.
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