Search
Search Results
-
A novel threshold changeable secret sharing scheme
A ( t, n ) threshold secret sharing scheme is a fundamental tool in many security applications such as cloud computing and multiparty computing. In...
-
Scientometric dimensions of cryptographic research
Information security has been a crucial issue in modern information management; thus cryptographic techniques have become inevitable to safeguard...
-
Cheating detectable threshold scheme against most powerful cheaters for long secrets
In this paper, we propose a framework of cheating-detectable threshold schemes against the most powerful cheaters. Our scheme is used to distribute...
-
Long term confidentiality: a survey
Sensitive electronic data may be required to remain confidential for long periods of time. Yet encryption under a computationally secure cryptosystem...
-
The complexity of the graph access structures on six participants
In this paper, we deal with determining the exact values for the complexity of the five graph access structures on six participants, which remained...
-
Asynchronous privacy-preserving iterative computation on peer-to-peer networks
Privacy preserving algorithms allow several participants to compute a global function collaboratively without revealing local information to each...
-
Signcryption schemes with threshold unsigncryption, and applications
The goal of a signcryption scheme is to achieve the same functionalities as encryption and signature together, but in a more efficient way than...
-
On the optimization of bipartite secret sharing schemes
Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access...
-
A new class of 3-fold perfect splitting authentication codes
Restricted strong partially balanced t -designs were first formulated by Pei, Li, Wang and Safavi-Naini in investigation of authentication codes with...
-
On-line secret sharing
In a perfect secret sharing scheme the dealer distributes shares to participants so that qualified subsets can recover the secret, while unqualified...
-
A new class of splitting 3-designs
Splitting t -designs were first formulated by Huber in recent investigation of optimal ( t − 1)-fold secure splitting authentication codes. In this...
-
Optimal complexity of secret sharing schemes with four minimal qualified subsets
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. This paper...
-
A general method for construction of (t, n)-threshold visual secret sharing schemes for color images
This paper is concerned with the construction of basis matrices of visual secret sharing schemes for color images under the ( t , n )-threshold access...
-
A class of authentication codes with secrecy
We study a class of authentication codes with secrecy. We determine the maximum success probabilities of the impersonation and the substitution...
-
Generalized oblivious transfer by secret sharing
The notion of Generalized Oblivious Transfer (GOT) was introduced by Ishai and Kushilevitz (Proceeding of ISTCS97, IEEE Computer Society, pp 174–184,...
-
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. (Two-channel...
-
Anonymity in shared symmetric key primitives
We provide a stronger definition of anonymity in the context of shared symmetric key primitives, and show that existing schemes do not provide this...
-
An impossibility result on graph secret sharing
A perfect secret sharing scheme based on a graph G is a randomized distribution of a secret among the vertices of the graph so that the secret can be...
-
Detection and identification of cheaters in (t, n) secret sharing scheme
In a ( t , n ) secret sharing scheme, a secret s is divided into n shares and shared among a set of n shareholders by a mutually trusted dealer in such...