[PDF] Top 20 Non-Malleable Secret Sharing for General Access Structures
Has 10000 "Non-Malleable Secret Sharing for General Access Structures" found on our website. Below are the top 20 most common "Non-Malleable Secret Sharing for General Access Structures".
Non-Malleable Secret Sharing for General Access Structures
... Statistical Non Malleability : To prove non-malleability of the current secret sharing scheme, we give a simulator for every admissible tampering attack on our scheme by using the simulator of ... See full document
29
Revisiting Non-Malleable Secret Sharing
... of non-malleable secret sharing for general access structures in this ...0 secret sharing ...give non-malleable secret sharing ... See full document
57
An Explication of Multifarious Secret Sharing Schemes
... the access structure and the subsets in Γ are called authorized ...a general access structure ...more general notion of access hierarchies and also studied tolerability properties of ... See full document
5
Secret Image Sharing for General Access Structures using Random Grids
... for general access structures is de- signed based on random ...a secret image into general access structures without any pixel expansion and codebook ...image ... See full document
8
Visual Secret Sharing Schemes for QR Code
... In general, it is difficult to examine the optimality of SS schemes realizing a general access structure in fact, the optimality has been shown so far only for very limited classes of SS schemes such ... See full document
5
A Construction for Secret Sharing Scheme with General Access Structure
... efficient secret sharing schemes for general access structures have been developed in efforts to deal with the problems of multi-party computations (MPC), threshold cryptography, and ... See full document
6
Secret Sharing Schemes for Very Dense Graphs
... a secret-sharing scheme realizing the graph can grow as a result of the removed ...for general access structures, considering the removal of minimal authorized subsets for any ... See full document
20
Optimal Linear Secret Sharing Schemes for Graph Access Structures on Six Participants
... cess structures on six participants. Study of such access structures were initiated by van Dijk ...nine access struc- tures, out of 18 initially unsolved non-isomorphic ones, were ... See full document
16
STRONGLY SECURE RAMP SECRET SHARING IN DISTRIBUTED DEDUPLICATION IN SYSTEMS
... A secret sharing scheme [7] is a technique to encrypt a secret S into n shares each of which has no information of S, but S can be decrypted by collecting numerous ...of secret sharing ... See full document
5
How to infinitely share a secret more efficiently
... a general secret sharing scheme for evolving access structures (following ...certain access structures compared to the general scheme in ...evolving access ... See full document
9
Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes
... in secret sharing is the Brickell-Davenport Theorem: every ideal perfect secret sharing scheme defines a matroid that is uniquely determined by the access ...ideal secret ... See full document
16
Towards Breaking the Exponential Barrier for General Secret Sharing
... linear secret-sharing schemes. We know there exist access functions that need 2 Ω(n) share size for linear secret sharing via a counting argument [KW93, ...ear secret ... See full document
29
Secret Sharing Schemes with General Access Structures (Full version)
... Abstract. Secret sharing schemes with general monotone access struc- tures have been widely discussed in the ...scenarios, non-monotone access structures may have more ... See full document
23
Non-Malleable Secret Sharing
... a secret sharing ...verifiable secret sharing, algebraic ma- nipulation detection(AMD) codes, and, error correcting or detecting codes in ...call non-malleable secret ... See full document
45
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
... construct non-malleable secret sharing schemes with respect to independent share tampering, both against a single tampering and against multiple ...any secret sharing scheme ... See full document
42
A Comprehensive Study on Various Visual cryptography Schemes with an Application
... reconstructed secret image when comparing with other ...visual secret sharing scheme using non-expanded meaningful shares with authentication was proposed by Der-Chyuan Lou et all ...visual ... See full document
5
Leakage-Resilient Secret Sharing
... However, there is another additional challenge: the correlation lower bounds of [BNS92] (and for other functions in the NOF model) work when the joint distribution on the inputs is uniform (or have very specific ... See full document
40
Inception Makes Non-malleable Codes Stronger
... (strong) non-malleable codes, and this result was im- proved by [CG14a] who showed that the optimal rate of these codes is ...continuous non-malleable codes against non-persistent ... See full document
26
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction
... rational secret sharing [11, 9, 1, 17, 13, 14, 7] are essentially based on the same underlying idea: The protocol consists of real rounds and fake ...the secret only in real rounds and cannot learn ... See full document
28
Tamper and Leakage Resilience in the Split-State Model
... input/output access to the device, get some side-channel information about its secret state, potentially on a continual basis; for example, an adversary can measure the power consumption of the device, ... See full document
30
Related subjects