Filters








41,817 Hits in 5.8 sec

An Unconditional Study of Computational Zero Knowledge

Salil P. Vadhan
2006 SIAM journal on computing (Print)  
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs.  ...  Our approach is to combine the conditional techniques previously used in the study of ZK with the unconditional techniques developed in the study of SZK, the class of problems possessing statistical zero  ...  Acknowledgments I am grateful to Emanuele Viola for an inspiring conversation about pseudoentropy and [HILL] that prompted me to revisit the questions addressed in this paper.  ... 
doi:10.1137/s0097539705447207 fatcat:m245bawwxfbfbger5nkoybhtbe

An Unconditional Study of Computational Zero Knowledge

S.P. Vadhan
45th Annual IEEE Symposium on Foundations of Computer Science  
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs.  ...  Our approach is to combine the conditional techniques previously used in the study of ZK with the unconditional techniques developed in the study of SZK, the class of problems possessing statistical zero  ...  Acknowledgments I am grateful to Emanuele Viola for an inspiring conversation about pseudoentropy and [HILL] that prompted me to revisit the questions addressed in this paper.  ... 
doi:10.1109/focs.2004.13 dblp:conf/focs/Vadhan04 fatcat:ldrp6h3p25bq5i6sajjxs2apye

Unconditional Characterizations of Non-interactive Zero-Knowledge [chapter]

Rafael Pass, abhi shelat
2005 Lecture Notes in Computer Science  
From our last result, we arrive at the following unconditional characterization of computational NIZK in the public parameter model (which complements well-known results for interactive zero-knowledge)  ...  In this paper, we obtain several unconditional characterizations of computational, statistical and perfect NIZK for all combinations of these settings.  ...  More recently, Vadhan [Vad04] also obtains unconditional characterizations of computational zero-knowledge. Open Questions.  ... 
doi:10.1007/11535218_8 fatcat:ri6ymgnlzbaodevzwgjbnoeiti

On Efficient Zero-Knowledge PCPs [chapter]

Yuval Ishai, Mohammad Mahmoody, Amit Sahai
2012 Lecture Notes in Computer Science  
We revisit the question of Zero-Knowledge PCPs, studied by Kilian, Petrank, and Tardos (STOC '97).  ...  We show that ZK-PCPs can be used to get black-box variants of this result with improved round complexity, as well as an unconditional zero-knowledge variant of Micali's non-interactive CS Proofs (FOCS  ...  We thank Vipul Goyal for collaboration at an early stage of this work.  ... 
doi:10.1007/978-3-642-28914-9_9 fatcat:by5mj3efbnb6xdqvdkvcgtp5qa

Sample Size Requirements for Zero-Order Models

Manohar U. Kalwani, Donald G. Morrison
1980 Journal of Marketing Research  
In many zero order applications, however, knowledge of market share and loyalty index, which are both functions of the original parameters, should be adequate.  ...  estimate parameters for zero order models.  ...  We demonstrated that, assuming zero order process and beta heterogeneity, conditional as well as unconditional switching and repeat purchase probability can be easily obtained from a knowledge of the market  ... 
doi:10.2307/3150932 fatcat:jhsdb6q52be2hh2zbkzt5k3huy

Studying a Range Proof Technique — Exception and Optimisation [chapter]

Kun Peng, Li Yi
2013 Lecture Notes in Computer Science  
We demonstrate that their batch proof and verification technique causes a concern such that in some cases a malicious prover without the claimed knowledge may pass the verification.  ...  As a result their range proof scheme to prove that a secret committed integer is in an interval range is not so reliable and cannot guarantee that the committed integer is in the range in some special  ...  On one hand it recognizes that sacrifice of unconditional soundness and perfect zero knowledge is necessary for high efficiency.  ... 
doi:10.1007/978-3-642-38553-7_19 fatcat:3ejiyzcngngzvh3i33fa6q73zu

Page 8764 of Mathematical Reviews Vol. , Issue 99m [page]

1999 Mathematical Reviews  
“On the basis of these commitments, we give efficient zero- knowledge proofs and arguments for arithmetic circuits over fi- nite prime fields; namely, given such a circuit, we show in zero- knowledge that  ...  {For the entire collection see MR 99g:68002. } 99m:68060 68Q15 94A60 Cramer, Ronald (CH-ETHZ; Ziirich) ; Damgard, Ivan (DK-ARHS-BRI; Aarhus) Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge  ... 

Page 282 of SPE Reservoir Evaluation & Engineering Vol. 9, Issue 3 [page]

2006 SPE Reservoir Evaluation & Engineering  
Our knowledge of this field is as follows: the unconditional mean of log permeability is zero, the variance of log permeability, o~,,,,, is unity, and the dimensionless correlation length, A,,,/L (L is  ...  SS CE hie bw oa cic cs cncceccs (12) where (¥(x)) is the unconditional log-permeability mean, a7, is the unconditional log-permeability variance, and ¢ is an arbitrary mul- tiplier, which we take to be  ... 

Regularization Paths for Conditional Logistic Regression: The clogitL1 Package

Stephen Reid, Rob Tibshirani
2014 Journal of Statistical Software  
Once implemented, the algorithm is used in simulation studies to compare the variable selection and prediction performance of the conditional logistic regression model against that of its unconditional  ...  natural unconditional prediction rules are hard to come by.  ...  The authors show that this rule is not safe and some parameter estimates that should be nonzero at the end of the iteration could be screened at the start of it.  ... 
pmid:26257587 pmcid:PMC4527184 fatcat:ghtbrladsjacnlksjbqbirs6jy

All Languages in NP Have Divertible Zero-Knowledge Proofs and Arguments Under Cryptographic Assumptions [chapter]

Mike V. D. Burmester, Yvo Desmedt
1991 Lecture Notes in Computer Science  
The first divertible zero-knowledge proof was given in [DGB88, in the context of an abuse-free zero-knowledge proof.  ...  We also remark that most divertible zero-knowledge proofs of membership presented here will not convince unconditionally two (independent) verifiers simultaneously.  ...  Acknowledgement We wish to thank Joan Boyar for suggesting, at Eurocrypt '89, that we investigate the divertible zero-knowledge aspects of the [BDPW89] protocol.  ... 
doi:10.1007/3-540-46877-3_1 fatcat:m2qjedhs2jg7fbvddhspwtyj7m

The Complexity of Zero Knowledge [chapter]

Salil Vadhan
2007 Lecture Notes in Computer Science  
We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own  ...  Zero Knowledge as an Object of Study We now turn zero knowledge as a complexity-theoretic object of study in itself.  ...  the study of zero-knowledge proofs.  ... 
doi:10.1007/978-3-540-77050-3_5 fatcat:3pfho3mpzrgx5i6zxepjni6m4a

A Monte Carlo comparison of categorical tests of independence [article]

Abdulaziz Alenazi
2020 arXiv   pre-print
In the small sample sized cases (≤ 1,000) though, we provide strong evidence supporting the use of the X^2 test regardless of zero frequencies for the case of unconditional independence.  ...  However, no one, to the best of our knowledge has compared them, extensively, and ultimately answer the question of which to use and when.  ...  Despite them being so broadly used, no one, to the best of our knowledge, has performed simulation studies in order to give guidance as to which test to use and when.  ... 
arXiv:2004.00973v1 fatcat:wq4i2wrry5h4fkfkrgm6mkma7q

Regularization Paths for Conditional Logistic Regression: TheclogitL1Package

Stephen Reid, Rob Tibshirani
2014 Journal of Statistical Software  
Once implemented, the algorithm is used in simulation studies to compare the variable selection and prediction performance of the conditional logistic regression model against that of its unconditional  ...  natural unconditional prediction rules are hard to come by.  ...  Without any prior knowledge of which parameter estimates are to become non-zero in the subsequent cyclic coordinate descent epoch, we are forced to compute s and the diagonal elements of H.  ... 
doi:10.18637/jss.v058.i12 fatcat:444hzrw4fbe7dnyoekoprhi2ba

Mapping species abundance by a spatial zero-inflated Poisson model: a case study in the Wadden Sea, the Netherlands

Olga Lyashevska, Dick J. Brus, Jaap van der Meer
2016 Ecology and Evolution  
The objective of the study was to provide a general procedure for mapping species abundance when data are zero-inflated and spatially correlated counts.  ...  Yet, the product of prevalence and intensity, which might be called the unconditional intensity, is very similar.  ...  Acknowledgments This study was part of the Wadden Long-Term Ecosystem Research (WaLTER) project that is financially supported by the Waddenfonds and the provinces of Fryslân and Noord Holland.  ... 
doi:10.1002/ece3.1880 pmid:26843936 pmcid:PMC4729254 fatcat:hqtvqq2tlrbf3pxxn7lexafela

Multiple attribute scenarios, bounded probabilities, and threats of nuclear theft

Craig W. Kirkwood, Stephen M. Pollock
1982 Futures : The journal of policy, planning and futures studies  
Wi) = 2 P,, (-1 or it is equal to zero, (3b) or it is greater than zero. Magnitude of two elements.  ...  knowledge available to someone outside the NMS system High: Has significant knowledge about nuclear science, computer technology, electronics, and related areas Low: Does not have significant know  ... 
doi:10.1016/0016-3287(82)90038-6 fatcat:t6aqnjl6yfdinlcmqdffekanum
« Previous Showing results 1 — 15 out of 41,817 results