Refactoring is a software development strategy that characteristically alters the syntactic structure of a program without changing its external behavior [2]. In this talk we present a methodology for extracting formal models from programs in order to evaluate how incremental refactorings affect the verifiability of their structural specifications. We envision that this same technique may be ap...

In this paper, we propose a blind multisignature scheme based on an extension of the RSA cryptosystem (called the ERSA system). Taking advantage of the scheme, we then present a new multiauthority electronic election system, which can meet all of the following requirements: eligibility, collision free, vigorousness of authorities, accuracy, privacy, verifiability, robustness, fairness, and prev...

We efficiently combine unpredictability and verifiability by extending the Goldreich–Goldwasser–Micali construction of pseudorandom functions fs from a secret seed s, so that knowledge of s not only enables one to evaluate fs at any point x, but also to provide an NP-proof that the value fs(x) is indeed correct without compromising the unpredictability of fs at any other point for which no such...

We show how to combine the individual verification mechanism of Selene with the coercion-resistant e-voting scheme from Juels, Catalano and Jakobsson (JCJ). This results in an e-voting scheme which allows the voter to check directly that her vote is counted as intended, but still allows her to mitigate coercion. We also construct variants of the protocol which provide everlasting privacy or bet...

Privacy and anonymity have become two factors of increasing importance in auction protocol. This paper provides an efficient sealed-bid electronic auction protocol based on the technique of ring signature and verifiable technique of encryption key chain. The peculiar characteristics of our protocol are non-repudiation of bidders but preserving their anonymity and allowing the auctioneer to dete...

Definitions of election verifiability in the computational model of cryptography are proposed. The definitions formalize notions of voters verifying their own votes, auditors verifying the tally of votes, and auditors verifying that only eligible voters vote. The Helios (Adida et al., 2009) and JCJ (Juels et al., 2010) election schemes are shown to satisfy these definitions. A previous definiti...

This paper addresses the identifier ownership problem. It does so by using characteristics of Statistic Uniqueness and Cryptographic Verifiability (SUCV) of certain entities which this document calls SUCV Identifiers and Addresses. Their characteristics allow them to severely limit certain classes of denial of service attacks and hijacking attacks. SUCV addresses are particularly applicable to ...

Abstract: A new ID-based anonymous proxy signature scheme from bilinear pairings was proposed in this paper. Anonymous proxy signature is suitable for the situation that the proxy signer’s identity needs to be kept secret. The verifier needs to reveal the real identity of the proxy signer with the help of the original signer. The signature is based on Gap Diffie-Hellman group problems and meets...

This proposal describes how data, program code, and presentation can be stored together in a single file suitable for electronic publication and permitting the reproduction of computational results.. Universality, efficiency, platformindependence, automated verifiability, and provenance tracking are the major design criteria. Existing and well-tested technology is used as much as possible, the ...

Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection, tamper detection, traitor tracing, maintaining integrity of relational data. Many watermarking techniques have been proposed in the literature to address these purposes. In this paper, we survey the current state-of-theart and we classify them according to their intent, the way they ex...