[PDF] Top 20 Secret Sharing and Statistical Zero Knowledge

... Efficient Secret-Sharing Schemes. Consider secret sharing schemes that are defined not for a given access structure, but uniformly for some class of access ...The sharing algorithm in ... See full document

... is statistical zero-knowledge arguments, first presented by Bras- sard, Chaum, and Crepeau in ...perfect zero-knowledge protocol for any statement in NP with constant rounds, which is a ... See full document

... current secret sharing scheme, we give a simulator for every admissible tampering attack on our scheme by using the simulator of the underlying non-malleable code after we have given an equivalent ... See full document

... • Statistical methods: They are known as model-based techniques because they modify the statistical characteristics of an image while keeping them in the embedding ...The statistical property of the ... See full document

... the secret has different interpretations in spite of the fact that, by assumption, all participants have infinite computing ...the secret suggests that we also need some probability ...with zero ... See full document

... Mobile Ad hoc Networks consist of mobile nodes without any centralized infrastructure. Here node may be affected by several attacks. It may cause the packet dropping, misrouting the information to another destination. In ... See full document

... Limitations. In Section 4 we establish two types of limitations on multi-input HSS. First, in Sec- tion 4.1, we show that weakly compact information-theoretic multi-input HSS schemes for security threshold t ≥ m/2 do not ... See full document

... variable with randomness coming solely from the internal randomness of the sharing algorithm. The notion of indistinguishability that we use is statistical (total variation) distance bounded by a leakage ... See full document

... Leakage Resilient Non-Malleable Codes. Unfortunately, all known constructions of 2 split- state statistical non-malleable codes can be trivially broken in our leakage model. All existing constructions use ... See full document

... Finally, we verify the robustness property. Let the random variable V denote the view of the adversary after (possibly adaptively) observing up to t shares. That is, V specifies the sequence of coordinate positions ... See full document

... the secret to a MPC (Multi-Party Protocol) that evaluates the sharing ...achieve statistical anonymity (even against semi-honest parties), one should account both for bounds on MPC with ... See full document

... threshold secret sharing scheme with a threshold value of t if only a coalition of t ≤ n participants can reconstruct the secret while t−1 or fewer participants ...the secret sharing ... See full document

... of secret sharing. Secret sharing is one of the early problems to be considered in ...a secret is divided into n pieces. With any k of the n pieces, the secret can be perfectly ... See full document

... a statistical CNMZK protocol by modifying the CNMZK protocol of [BPS06] with mixed non-malleable commitment scheme MXNMCom ...the statistical indistinguishability of the simulation, the string is set so ... See full document

... honest-verifier zero-knowledge protocols to protocols in which the zero-knowledge property holds against arbitrary ...the zero- knowledge property to hold against computationally ... See full document

... protect secret images or important data from being tampered or grabbed. Secret sharing scheme has turn into an important concept in information protection and ...Visual Secret Sharing ... See full document

...  [4] Strengthen the Security of Confidential Information utilizing Cryptographic Technique by Prasanna Kumar H.R and Dr. Niranjan N Chiplunkar, are utilized two strategies, in the main technique they encode the ... See full document

... Rabin et al. [18] used an information checking protocol to verify the validity of each share and thereby detect cheaters. VSS allows detecting cheating by secret participants and/or the secret dealer (e.g. ... See full document

... for Secret Key Recovery will be introduced to improve the key recovery performance with non-divided secret ...the secret in to n row and k column [22] which size of n,k matrix needs to consider ...of ... See full document

... The shares are signed by the dealer. Hence, no player can give out false shares undetected and the only possible action of a player in a round is to either 1) send the message or 2) remain silent. The round in which the ... See full document