Nethodological problems in Men[ague Grammar are discussed. Our observations show that a model-theoretic approach to natural language semantics is inadequate with respect to i t s v e r i f i a b i l i t y from logical point of view. But, the formal a t t i tudes seem to be of use for the development in computational

The paper deals with the long-term validation of the authen-ticity of electronic healthcare records (EHR). Although the attributes of data authenticity, i.e. integrity and origin ve-ri-fi-a-bi-lity, can be pre-served by digital signatures, the necessary period for the re-ten-tion of EHR is far beyond the lifespan of a simple digital signature. This lifespan is restricted by the va-li-di-ty peri...

Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...

In this paper we propose a homomorphic encryption-based secure electronic voting scheme that is based on [5]. It guarantees eligibility, unreusability, privacy, verifiability and also receipt-freeness and uncoercibility. The scheme can be implemented in a practical environment, since it does not use voting booth or untappable channel, only anonymous channels are applied.

Since its appearance in 2008, blockchain technology has found multiple uses fields such as banking, supply chain management, and healthcare. One of the most intriguing is voting systems, where can overcome security transparency concerns that plague traditional systems. This paper provides a thorough examination implementation blockchain-based system. The proposed system employs cryptographic me...

One of the most important verifiability techniques for mix nets is randomized partial checking (RPC). This method employed in a number prominent secure e-voting systems, including Pret Voter, Civitas, and Scantegrity II, some which have also been used real political elections Australia.

This paper combines cryptographic voting and web page ranking and proves that it is possible to hold elections so as not to limit a voter by a list of candidates, to benefit from voter’s personal experience in dealing with people, to make wide and proportional representation, and to achieve secrecy, including incoercibility, and verifiability of cryptographic voting systems.

We introduce verifiable agreement as a fundamental service for securing mobile peer-to-peer ad hoc networks, and investigate its solvability. Verifiability of a protocol result means that the participants can prove that the protocol reached a particular result to any third party (the verifier) which was not present in the network at the time of the protocol execution.

In this chapter, a systematic review of database watermarking is provided. The existing database watermarking approaches are classified along six dimensions: data type, distortion to underlying data, sensitivity to database attacks, watermark information, verifiability, and data structure. At the end of this chapter, some open issues are discussed.