نتایج جستجو برای: verifiability

تعداد نتایج: 874  

2005
Michael R. Clarkson Andrew C. Myers

The recently proposed Prêt à Voter election scheme uses decryption mixes to achieve anonymity of votes and verifiability of an election while requiring minimal trust in the component of the election system that performs these mixes. However, this scheme still requires trust in several human and machine components; these requirements make the scheme impractical for use in remote voting. To adapt...

2007

Verifiability is an important component of elections. It is related to aspects like trust in the correctness of the election results, transparency of the election processes, and preparation for a possible contestation of the election. In particular the last aspect is of crucial importance in legally regulated elections. Verifiability in this context means that voting systems must be designed co...

2015
Roland Wen Richard Buckland

Executive Summary and Recommendations This submission addresses two issues related to e-voting in Victoria: i. Problems with the underlying design of the scaled-down prototype of the vVote e-voting system used in the 2014 Victorian State Election make it unsuitable for larger-scale general use in future elections. ii. Lessons learned from the 2014 vVote trial and from similar trials internation...

Journal: :IRA International Journal of Education and Multidisciplinary Studies (ISSN 2455-2526) 2017

Journal: :The B.E. Journal of Theoretical Economics 2008

Journal: :Lecture Notes in Computer Science 2022

The Universal Composability (UC) framework (FOCS ’01) is the current standard for proving security of cryptographic protocols under composition. It allows to reason about complex protocol structures in a bottom-up fashion: any building block that UC-secure can be composed arbitrarily with other construction while retaining their guarantees. Unfortunately, some properties such as verifiability o...

2008
Lucie Langer Axel Schmidt Roberto Araújo

We present an improvement of Ohkubo et al.’s e-voting protocol [OMA99]: We provide that the validator’s signature is attached directly to the vote although the vote has been encrypted before. Thus verifiability does not end before tallying like in the original scheme but is pervasive even beyond the end of the election. This prevents manipulation of the plaintext votes and offers verifiability ...

2008
Manfred Stadler

As is well-known from the literature on oligopolistic competition with incomplete information, firms have incentives to share private value demand information. However, by assuming verifiability of demand data, these models ignore the possibility of strategic misinformation. We show that if firms can send misleading demand information, they will always do so. Furthermore, we derive a costly sig...

2013
Hassan Elkamchouchi Eman Abou El-kheir Yasmine Abouelseoud

Authentication and confidentiality are the most important security goals to be achieved. This paper proposes a new tripartite signcryption scheme without bilinear pairings. The proposed tripartite signcryption scheme is efficient when three entities want to perform secure transactions as in mobile communication or in e-commerce. The proposed scheme is based on the elliptic curve discrete logari...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید