scholarly journals Statistical Secrecy and Multi-Bit Commitments

1996 ◽  
Vol 3 (45) ◽  
Author(s):  
Ivan B. Damgård ◽  
Torben P. Pedersen ◽  
Birgit Pfitzmann
Keyword(s):  
Communication Complexity ◽  
Probability Distributions ◽  
The Other ◽  
L1 Norm ◽  
Shannon Theory ◽  
Bit Commitment ◽  
Commitment Schemes ◽  
Total Communication ◽  
Index Terms ◽  
Bit Commitments

<p>We present and compare definitions of the notion of "statistically<br />hiding" protocols, and we propose a novel statistically hiding commitment<br />scheme. Informally, a protocol statistically hides a secret if a<br />computationally unlimited adversary who conducts the protocol with<br />the owner of the secret learns almost nothing about it. One definition<br />is based on the L1-norm distance between probability distributions,<br />the other on information theory. We prove that the two definitions are<br />essentially equivalent. For completeness, we also show that statistical<br />counterparts of definitions of computational secrecy are essentially<br />equivalent to our main definitions. Commitment schemes are an important<br /> cryptologic primitive. Their purpose is to commit one party to a certain value,<br /> while hiding this value from the other party until some later time.<br /> We present a statistically<br />hiding commitment scheme allowing commitment to many<br />bits. The commitment and reveal protocols of this scheme are constant<br />round, and the size of a commitment is independent of the number of<br />bits committed to. This also holds for the total communication complexity,<br />except of course for the bits needed to send the secret when it<br />is revealed. The proof of the hiding property exploits the equivalence<br />of the two definitions.</p><p>Index terms -- Cryptology, Shannon theory, unconditional security,<br />statistically hiding, multi-bit commitment, similarity of ensembles<br />of distributions, zero-knowledge, protocols.</p><p> </p>

scholarly journals Linear Zero-Knowledgde. A Note on Efficient Zero-Knowledge Proofs and Arguments

1996 ◽  
Vol 3 (7) ◽  
Author(s):  
Ivan B. Damgård ◽  
Ronald Cramer
Keyword(s):  
Error Probability ◽  
Communication Complexity ◽  
Boolean Formula ◽  
Interactive Proof ◽  
Zero Knowledge ◽  
Bit Commitment ◽  
Commitment Scheme ◽  
Commitment Schemes ◽  
Realistic Situation ◽  
Language L

We present a zero-knowledge proof system [19] for any NP language L, which<br />allows showing that x in L with error probability less than 2^−k using communication<br />corresponding to O(|x|^c) + k bit commitments, where c is a constant depending only<br />on L. The proof can be based on any bit commitment scheme with a particular set<br />of properties. We suggest an efficient implementation based on factoring.<br />We also present a 4-move perfect zero-knowledge interactive argument for any NP-language<br />L. On input x in L, the communication complexity is O(|x|^c) max(k; l)<br />bits, where l is the security parameter for the prover. Again, the protocol can be<br />based on any bit commitment scheme with a particular set of properties. We suggest<br />efficient implementations based on discrete logarithms or factoring.<br />We present an application of our techniques to multiparty computations, allowing<br />for example t committed oblivious transfers with error probability 2^−k to be done<br />simultaneously using O(t+k) commitments. Results for general computations follow<br />from this.<br />As a function of the security parameters, our protocols have the smallest known<br />asymptotic communication complexity among general proofs or arguments for NP.<br />Moreover, the constants involved are small enough for the protocols to be practical in<br />a realistic situation: both protocols are based on a Boolean formula Phi containing and-<br />, or- and not-operators which verifies an NP-witness of membership in L. Let n be<br />the number of times this formula reads an input variable. Then the communication<br />complexity of the protocols when using our concrete commitment schemes can be<br />more precisely stated as at most 4n + k + 1 commitments for the interactive proof<br />and at most 5nl +5l bits for the argument (assuming k <= l). Thus, if we use k = n,<br />the number of commitments required for the proof is linear in n.<br />Both protocols are also proofs of knowledge of an NP-witness of membership in<br />the language involved.

Pembobotan Berdasarkan Tingkat Kesamaan Semantik pada Metode Fuzzy Semi-Supervised Co-Clustering untuk Pengelompokkan Dokumen Teks

2014 ◽  
Vol 6 (2) ◽  
pp. 46-51
Author(s):  
Galang Amanda Dwi P. ◽  
Gregorius Edwadr ◽  
Agus Zainal Arifin
Keyword(s):  
Supervised Learning ◽  
Semantic Similarity ◽  
The Other ◽  
Classification Result ◽  
Document Similarity ◽  
The Matrix ◽  
Index Terms ◽  
Membership Value ◽  
Degree Of Similarity

Nowadays, a large number of information can not be reached by the reader because of the misclassification of text-based documents. The misclassified data can also make the readers obtain the wrong information. The method which is proposed by this paper is aiming to classify the documents into the correct group.  Each document will have a membership value in several different classes. The method will be used to find the degree of similarity between the two documents is the semantic similarity. In fact, there is no document that doesn’t have a relationship with the other but their relationship might be close to 0. This method calculates the similarity between two documents by taking into account the level of similarity of words and their synonyms. After all inter-document similarity values obtained, a matrix will be created. The matrix is then used as a semi-supervised factor. The output of this method is the value of the membership of each document, which must be one of the greatest membership value for each document which indicates where the documents are grouped. Classification result computed by the method shows a good value which is 90 %. Index Terms - Fuzzy co-clustering, Heuristic, Semantica Similiarity, Semi-supervised learning.

Seismic hazard sensitivity analysis: A multi-parameter approach

1991 ◽  
Vol 81 (3) ◽  
pp. 796-817
Author(s):  
Nitzan Rabinowitz ◽  
David M. Steinberg
Keyword(s):  
Sensitivity Analysis ◽  
Seismic Hazard ◽  
Subjective Probability ◽  
Probability Distributions ◽  
Input Parameter ◽  
The Other ◽  
Probabilistic Assessment ◽  
Input Parameters ◽  
Parameter Approach

Abstract We propose a novel multi-parameter approach for conducting seismic hazard sensitivity analysis. This approach allows one to assess the importance of each input parameter at a variety of settings of the other input parameters and thus provides a much richer picture than standard analyses, which assess each input parameter only at the default settings of the other parameters. We illustrate our method with a sensitivity analysis of seismic hazard for Jerusalem. In this example, we find several input parameters whose importance depends critically on the settings of other input parameters. This phenomenon, which cannot be detected by a standard sensitivity analysis, is easily diagnosed by our method. The multi-parameter approach can also be used in the context of a probabilistic assessment of seismic hazard that incorporates subjective probability distributions for the input parameters.

scholarly journals Summoning, No-Signalling and Relativistic Bit Commitments

Entropy ◽  
2019 ◽  
Vol 21 (5) ◽  
pp. 534
Author(s):  
Adrian Kent
Keyword(s):  
Necessary Conditions ◽  
Causal Structure ◽  
Distributed Networks ◽  
Space Time ◽  
Quantum Measurements ◽  
Bit Commitment ◽  
Projection Postulate ◽  
Independent Functioning ◽  
Commitment Protocols ◽  
Bit Commitments

Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later point, belonging to a subset defined by communications received from Bob at other points. Many results about summoning, including the impossibility of unrestricted summoning tasks and the necessary conditions for specific types of summoning tasks to be possible, follow directly from the quantum no-cloning theorem and the relativistic no-superluminal-signalling principle. The impossibility of cloning devices can be derived from the impossibility of superluminal signalling and the projection postulate, together with assumptions about the devices’ location-independent functioning. In this qualified sense, known summoning results follow from the causal structure of space-time and the properties of quantum measurements. Bounds on the fidelity of approximate cloning can be similarly derived. Bit commitment protocols and other cryptographic protocols based on the no-summoning theorem can thus be proven secure against some classes of post-quantum but non-signalling adversaries.

On the wind resource in Algeria: Probability distributions evaluation

2020 ◽  
pp. 095765092097588
Author(s):  
Houdayfa Ounis ◽  
Nawel Aries
Keyword(s):  
Wind Speed ◽  
Probability Distribution ◽  
Probability Distributions ◽  
Resource Assessment ◽  
Descriptive Statistics ◽  
The Other ◽  
Wind Speeds ◽  
Wind Resource Assessment ◽  
The Mean ◽  
Wind Resource

The present study aims to present a contribution to the wind resource assessment in Algeria using ERA-Interim reanalysis. Firstly, the ERA-Interim reanalysis 10 m wind speed data are considered for the elaboration of the mean annual 10 m wind speed map for a period starting from 01-01-2000 to 31-12-2017. Moreover, the present study intends to highlight the importance of the descriptive statistics other than the mean in wind resource assessment. On the other hand, this study aims also to select the proper probability distribution for the wind resource assessment in Algeria. Therefore, nine probability distributions were considered, namely: Weibull, Gamma, Inverse Gaussian, Log Normal, Gumbel, Generalized Extreme Value (GEV), Nakagami, Generalized Logistic and Pearson III. Furthermore, in combination with the distribution, three parameter estimation methods were considered, namely, Method of Moment, Maximum Likelihood Method and L-Moment Method. The study showed that Algeria has several wind behaviours due to the diversified topographic, geographic and climatic properties. Moreover, the annual mean 10 m wind speed map showed that the wind speed varies from 2.3 to 5.3 m/s, where 73% of the wind speeds are above 3 m/s. The map also showed that the Algerian Sahara is windiest region, while, the northern fringe envelopes the lowest wind speeds. In addition, it has been shown that the study of the mean wind speeds for the evaluation of the wind potential alone is not enough, and other descriptive statistics must be considered. On the other hand, among the nine considered distribution, it appears that the GEV is the most appropriate probability distribution. Whereas, the Weibull distribution showed its performance only in regions with high wind speeds, which, implies that this probability distribution should not be generalized in the study of the wind speed in Algeria.

scholarly journals Statistical Aspects of Wasserstein Distances

2019 ◽  
Vol 6 (1) ◽  
pp. 405-431 ◽  
Author(s):  
Victor M. Panaretos ◽  
Yoav Zemel
Keyword(s):  
Probability Distributions ◽  
The Other ◽  
Mass Transportation ◽  
Complex Objects ◽  
Convergence Of Moments ◽  
Natural Notion ◽  
Versatile Tool ◽  
Probability Mass ◽  
Minimal Effort ◽  
Wasserstein Distances

Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in order to recover the other distribution. They are ubiquitous in mathematics, with a long history that has seen them catalyze core developments in analysis, optimization, and probability. Beyond their intrinsic mathematical richness, they possess attractive features that make them a versatile tool for the statistician: They can be used to derive weak convergence and convergence of moments, and can be easily bounded; they are well-adapted to quantify a natural notion of perturbation of a probability distribution; and they seamlessly incorporate the geometry of the domain of the distributions in question, thus being useful for contrasting complex objects. Consequently, they frequently appear in the development of statistical theory and inferential methodology, and they have recently become an object of inference in themselves. In this review, we provide a snapshot of the main concepts involved in Wasserstein distances and optimal transportation, and a succinct overview of some of their many statistical aspects.

Schrödinger-Iike equations for spin measurements, states, and wave functions, based on the statistical approach of Guiasu

1994 ◽  
Vol 72 (3-4) ◽  
pp. 130-133
Author(s):  
Paul B. Slater
Keyword(s):  
Statistical Estimation ◽  
Statistical Approach ◽  
Probability Distributions ◽  
Wave Functions ◽  
The Other ◽  
Weight Functions ◽  
Information Theoretic ◽  
Mixed Spin ◽  
Spin Measurements ◽  
Schrödinger Form

Guiasu employed a statistical estimation principle to derive time-independent Schrödinger equations for the position but, as is usual, not the spin of a particle. Here, on the other hand, this principle is used to obtain Schrödinger-like equations for the spin but not the position of a particle. Steady states are described by continuous probability distributions, obtained by information-theoretic arguments, over spin measurements, states, and wave functions. These distributions serve as weight functions for orthogonal polynomials. Associated "wave functions," products of the polynomials and the square root of the weight function, satisfy differential equations, reducing to time-independent Schrödinger form at the point corresponding to the fully mixed spin-1/2 state.

Optimal multi-bit commitment reductions to weak bit commitments

2003 ◽  
Author(s):  
A.C.A. Nascimento ◽  
J. Mueller-Quade ◽  
H. Imai
Keyword(s):  
Bit Commitment ◽  
Bit Commitments

Probability Distributions of Vertical Bending Moments on a FPSO in Abnormal Wave Seastates

2007 ◽  
Author(s):  
Nuno Fonseca ◽  
Ricardo Pascoal ◽  
Carlos Guedes Soares
Keyword(s):  
Probability Distributions ◽  
The Other ◽  
Wave Crest ◽  
Large Set ◽  
Bending Moments ◽  
Wave Groups ◽  
Wave Elevation ◽  
Other Hand

A method to calculate the responses of a FPSO in deterministic wave traces with abnormal waves, has been applied to calculate the motions and global structural loads induced by a large set of abnormal waves that were measured in different places. The present paper is focused on the probability distributions of the motions and global structural loads induced by the seastates which included the abovementioned abnormal waves. The objective is to compare the distributions of the wave elevation with the abnormal wave crest and trough, and to compare the distributions of the platform responses with the responses induced by the abnormal waves. In this way it is possible to conclude if the abnormal waves induce abnormal responses of the platform, or if on the other hand there are wave groups with waves smaller than the abnormal wave that induce larger responses.

scholarly journals On the question of secret probability distributions in quantum bit commitment

2019 ◽  
Vol 58 ◽  
pp. 320-323
Author(s):  
Chi-Yee Cheung
Keyword(s):  
Probability Distributions ◽  
Quantum Bit ◽  
Bit Commitment
Sign in / Sign up

Export Citation Format

Share Document