Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers. Abe, M. 1998. Paper doi abstract bibtex In this paper we construct a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.
@conference {abe,
title = {Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers},
booktitle = {Proceedings of EUROCRYPT 1998},
year = {1998},
publisher = {Springer-Verlag, LNCS 1403},
organization = {Springer-Verlag, LNCS 1403},
abstract = {In this paper we construct a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.},
keywords = {electronic voting, mix, universal verifiability},
isbn = {978-3-540-64518-4},
doi = {10.1007/BFb0054144},
url = {http://www.springerlink.com/content/hl8838u4l9354544/},
author = {Masayuki Abe}
}
Downloads: 0
{"_id":"EpXrvKRJEt7ANmpBQ","bibbaseid":"abe-universallyverifiablemixnetwithverificationworkindependentofthenumberofmixservers-1998","downloads":0,"creationDate":"2018-07-03T04:50:29.915Z","title":"Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers","author_short":["Abe, M."],"year":1998,"bibtype":"conference","biburl":"https://gnunet.org/bibliography/export/bibtex","bibdata":{"bibtype":"conference","type":"conference","title":"Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers","booktitle":"Proceedings of EUROCRYPT 1998","year":"1998","publisher":"Springer-Verlag, LNCS 1403","organization":"Springer-Verlag, LNCS 1403","abstract":"In this paper we construct a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.","keywords":"electronic voting, mix, universal verifiability","isbn":"978-3-540-64518-4","doi":"10.1007/BFb0054144","url":"http://www.springerlink.com/content/hl8838u4l9354544/","author":[{"firstnames":["Masayuki"],"propositions":[],"lastnames":["Abe"],"suffixes":[]}],"bibtex":"@conference {abe,\n\ttitle = {Universally Verifiable mix-net With Verification Work Independent of The Number of mix Servers},\n\tbooktitle = {Proceedings of EUROCRYPT 1998},\n\tyear = {1998},\n\tpublisher = {Springer-Verlag, LNCS 1403},\n\torganization = {Springer-Verlag, LNCS 1403},\n\tabstract = {In this paper we construct a universally verifiable Mix-net where the amount of work done by a verifier is independent of the number of mix-servers. Furthermore, the computational task of each mix-server is constant against the number of mix-servers except for some negligible tasks like addition. The scheme is robust, too.},\n\tkeywords = {electronic voting, mix, universal verifiability},\n\tisbn = {978-3-540-64518-4},\n\tdoi = {10.1007/BFb0054144},\n\turl = {http://www.springerlink.com/content/hl8838u4l9354544/},\n\tauthor = {Masayuki Abe}\n}\n","author_short":["Abe, M."],"key":"abe","id":"abe","bibbaseid":"abe-universallyverifiablemixnetwithverificationworkindependentofthenumberofmixservers-1998","role":"author","urls":{"Paper":"http://www.springerlink.com/content/hl8838u4l9354544/"},"keyword":["electronic voting","mix","universal verifiability"],"downloads":0},"search_terms":["universally","verifiable","mix","net","verification","work","independent","number","mix","servers","abe"],"keywords":["electronic voting","mix","universal verifiability"],"authorIDs":[],"dataSources":["FWsPTwsmjtrBtRS3B"]}