VSS (verifiable secret sharing) is an important security protection tool in distributed systems. When VSS is employed in publicly verifiable applications, it needs to achieve public verifiability and be upgraded to PVSS (publicly verifiable secret sharing). Besides the two basic security properties, bindingness and hidingness, PVSS concentrates on public verifiability of validity all the operat...

We develop a model of strategic contractual incompleteness that identifies conditions under which principals might omit even costlessly verifiable terms. We then use experiments to test comparative statics predictions of the model. While it is well known that verifiability imperfections can limit complete contracting, researchers know less about how the degree of imperfection affects endogenous...

We discuss the use of POLYAS, an Internet voting system, in GI (German Society for Computer Scientists (Gesellschaft für Informatik e.V.)) elections before 2010, in 2010 and 2011, as well as in the future. We briefly describe how the system was extended in 2010 to provide partial verifiability and how the integrity of the GI election result was verified in the 2010 and 2011 elections. Informati...

iii Preface Hundreds or even thousands of international legal instruments on "the environment" are in existence. What happens to international environmental agreements once they are signed, and how does the process of implementing such agreements influence their effectiveness? These are the questions that motivate the IIASA project "Implementation and Effectiveness of International Environmenta...

SUMMARY Multisignature scheme realizes that plural users generate the signature on a message, and that the signature is verified. Various studies on multisignature have been proposed([2], [6], [11], [15], [18]). They are classified into two types: RSA([13])-based multisignature([6], [11]), and discrete logarithm problem(DLP) based multisig-nature([2], [15], [18]), all of which assume that a mes...

Numerous metrics have been developed that attempt to assess the reliability of phylogenetic trees. Several of these commonly used measures of tree and tree branch support are described and discussed in the context of their relationship to Popperian corroboration. Claims that measures of support indicate the accuracy of phylogenetic trees or provide information for tree choice are rebutted. Meas...

The Helios voting scheme is well studied including formal proofs for verifiability and ballot privacy, but it does not provide participation privacy (i.e. it reveals who participated in the election). Kulyk, Teague and Volkamer proposed an extension to Helios that is claimed to provide ballot privacy as well as participation privacy while providing verifiability against a malicious bulletin boa...

After the trials of remote internet voting for local elections in 2011 and parliamentary elections in 2013, a number of local referendums has renewed interest in internet voting in Norway. The voting scheme used in Norway is not quantum-safe and it has limited voter verifiability. In this case study, we consider how we can use fully homomorphic encryption to construct a quantum-safe voting sche...

When developing a catalogue of technical requirements for online voting systems to be used in legally ruled, non-parliamentary elections, major interdisciplinary problems arise which currently cannot be solved. Technical requirements are not yet definable due to lacking legal preconditions, and legal definitions are not yet definable due to lacking technical experience. Problems of this type ar...