Results 31 to 40 of about 20,623 (302)
Secret Sharing on Superconcentrator
We study the arithmetic circuit complexity of threshold secret sharing schemes by characterizing the graph-theoretic properties of arithmetic circuits that compute the shares. Using information inequalities, we prove that any unrestricted arithmetic circuit (with arbitrary gates and unbounded fan-in) computing the shares must satisfy superconcentrator ...
openaire +2 more sources
(k,n) secret image sharing scheme capable of cheating detection
In a (k,n) threshold secret image sharing scheme, a secret image is encrypted into n image-shadows that satisfy the following: (1) any less than k image-shadows get no information on the image and (2) any k or more image-shadows can reconstruct the ...
Yan-Xiao Liu +2 more
doaj +1 more source
Secret sharing schemes for ports of matroids of rank 3 [PDF]
summary:A secret sharing scheme is ideal if the size of each share is equal to the size of the secret. Brickell and Davenport showed that the access structure of an ideal secret sharing scheme is determined by a matroid.
Oriol Farràs, Farràs, Oriol
core +1 more source
A Secure Boolean-based Multi-Secret Image Sharing Scheme
Multiple secret images Boolean XORAn (n, n) multi-secret image sharing scheme shares n secret images among n shared images. In this type of schemes, n shared images can be used to recover all n secret images, but the loss of any shared image prevents the
陳建彰; 吳緯杰, 陳建彰
core +1 more source
Study of Free‐Space Optical Quantum Network: Review and Prospectives
Free from the constraints of fiber connections, free‐space quantum network enables longer and more flexible quantum network connections. This review summarizes and comparatively analyzes free‐space quantum network experiments based on ground stations, satellites, and mobile platforms.
Hua‐Ying Liu, Zhenda Xie, Shining Zhu
wiley +1 more source
Constructions of some secret sharing schemes based on linear codes [PDF]
There are perfect and ideal threshold secret sharing schemes, for example, Shamir’s secret sharing scheme. For the case of general secret sharing schemes with an arbitrary access structure, it is possible to construct a perfect scheme for any
Ratseev, Sergey Mihailovich
doaj +1 more source
Reusing Shares in Secret Sharing Schemes [PDF]
A (t, w) threshold scheme is a method for sharing a secret among w shareholders so that the collaboration of at least t shareholders is required in order to reconstruct the shared secret. This paper is concerned with the re-use of shares possessed by shareholders in threshold schemes.
Yuliang Zheng 0001 +2 more
openaire +2 more sources
Cheating immune secret sharing
We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original ...
Josef Pieprzyk +3 more
core +1 more source
Femtosecond‐Laser‐Induced Physical Unclonable Random Maze Structure for Storage‐Free Encryption
Femtosecond‐laser‐induced gold random maze structures serve as multimodal physical unclonable functions for storage‐free encryption. Their stochastic optical, electrical, and Raman responses are generated by plasmon‐assisted Marangoni formation and converted into AES‐compatible keys without permanent secret‐key storage, offering a portable route toward
Shiru Jiang +6 more
wiley +1 more source
ABSTRACT Vending is an important sector in the daily lives of many people, and coffee is the most frequently consumed product in the European market. Like many other sectors, vending is responding to the challenge of sustainable development by taking various actions, such as offering increasingly ecologically sound coffee while maintaining/improving ...
Alberto Bertossi +2 more
wiley +1 more source

