With the possible birth of quantum computer, traditional secret sharing schemes have been unable to meet security requirements. We proposed a new verifiable multi-secret scheme based on short integer solution problem. By utilizing symmetric binary polynomial, $k$ secrets and shares can be genera...

In (k, n) threshold secret sharing, a is converted into n shares such that any k or more allow for the reconstruction of this secret; however, total storage cost increases. By contrast, asymmetric sharing reduces to be stored. When implementing in cloud, if malicious players submit forged during process, reconstructed value will differ from original secret. Therefore, method quick...

This work is motivated by the following concern. Suppose we have a game exhibiting multiple Nash equilibria, with little to distinguish them except that one of them can be verified while the others cannot. That is, one of these equilibria carries sufficient information that, if this is the outcome, then the players can tell that an equilibrium has been played. This provides an argument for this...

Aiming for strong security assurance, recently there has been an increasing interest in formal verification of cryptographic constructions. This paper presents a mechanised formal verification of the popular Pedersen commitment protocol, proving its security properties of correctness, perfect hiding, and computational binding. To formally verify the protocol, we extended the theory of EasyCrypt...

We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good “test case” for our understanding of round complexity in general; moreover, VSS is important in its own right as a central building block for, e.g., Byzantine agreement and secure multi-party computation. The round complexity of perfect VSS was settled by ...

Secret sharing deals with the problem of securely distributing confidential information among a certain number of users, in such a way that only some subsets of them are able to jointly decrypt it. Several schemes and variants of secret sharing have been proposed, from the seminal schemes of Shamir and Blakley, which are based respectively on polynomial interpolation, and hyperplanes intersecti...

To become an indispensable part of the Internet of Things (IoT), wireless sensor networks (WSNs) have to be integrated into the Internet. Under such circumstances, any IP-enabled node in the Internet shall be able to directly communicate with any sensor node in a WSN. Then, multiple sensor nodes can be used to monitor an event and jointly generate a report to be sent to one or more Internet nod...

To the authors’ knowledge, there are not many cryptosystems proven to be as difficult as or more difficult than the discrete logarithm problem. Concerning problems related to the discrete logarithm problem, there are problems called the double discrete logarithm problem and the e-th root of the discrete logarithm problem. These two problems are likely to be difficult and they have been utilized...

With the development and innovation of new techniques for 5G, 5G networks can provide extremely large capacity, robust integrity, high bandwidth, low latency multimedia image sharing storage. However, it will surely exacerbate privacy problems intrinsic to transformation. Due security reliability requirements storing sensitive images in network environment, verifiable steganography-based secret...

Expert reviews, laboratory tests, and a large-scale field study of one paper/optical scan and five electronic voting systems suggested numerous possible improvements. Changes could be made in all aspects of the process—signing-on, navigating across the ballot, checking and changing votes, casting write-in votes, and reviewing and casting the ballot. A paper trail was largely ignored by voters. ...