Results 11 to 20 of about 116 (50)
Optimal Information Rate of Secret Sharing Schemes on Trees [PDF]
, 2013 The information rate for an access structure is the reciprocal of the load of the optimal secret sharing scheme for this structure. We determine this value for all trees: it is (2 - 1/c)(-1), where is the size of the largest core of the tree. A subset of
Csirmaz, László, Tardos, Gábor
core +2 more sources
Towards efficient private distributed computation on unbounded input streams
Journal of Mathematical Cryptology, 2015 In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the ...
Dolev Shlomi +4 more
doaj +1 more source
Persistent asymmetric password-based key exchange
Journal of Mathematical Cryptology, 2014 Asymmetric password based key exchange is a key exchange protocol where a client and a server share a low entropic password while the server additionally owns a high entropic secret with respect to a public key. There are simple solutions for this, e.g.,
Jiang Shaoquan
doaj +1 more source
Near-complete external difference families [PDF]
, 2016 We introduce and explore near-complete external difference families, a partitioning of the nonidentity elements of a group so that each nonidentity element is expressible as a difference of elements from distinct subsets a fixed number of times.
Davis, James A. +2 more
core +1 more source
Context-Aware Access Control Model for Privacy Support in Mobile-Based Assisted Living
Journal of Intelligent Systems, 2015 The average lifetime of people in advanced countries is significantly increased in the XXI century. The number of old and dependent people is rising due many innovations in health care: new technologies, medicine, and a lot of innovative devices that ...
Smirnov Alexander +3 more
doaj +1 more source
A survey and refinement of repairable threshold schemes
Journal of Mathematical Cryptology, 2018 We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers.
Laing Thalia M., Stinson Douglas R.
doaj +1 more source
Disjoint difference families and their applications [PDF]
, 2015 Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families ...
Ng, S.-L., Paterson, Maura B.
core +5 more sources
Classical access structures of ramp secret sharing based on quantum stabilizer codes [PDF]
, 2020 In this paper, we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers.
Yamashita, Ryutaro
core +1 more source
A generalization of the Mignotte's scheme over Euclidean domains and applications to secret image sharing [PDF]
, 2019 Secret sharing scheme is an efficient method to hide secret key or secret image by partitioning it into parts such that some predetermined subsets of partitions can recover the secret but remaining subsets cannot.
Ozbek, Ibrahim +2 more
core +2 more sources
A characterisation of ideal weighted secret sharing schemes
Journal of Mathematical Cryptology, 2015 Beimel, Tassa and Weinreb [SIAM J. Discrete Math. 22 (2008), 360–397] and Farràs and Padró [Lecture Notes in Comput. Sci. 5978, Springer, 2010, 219–236] partially characterised access structures of ideal weighted secret sharing schemes in terms of the ...
Hameed Ali, Slinko Arkadii
doaj +1 more source