Probabilistic Point-to-Point Information Leakage
... In this sense, our aim is to create a model of information leakage that makes it convenient to measure leaks between given points in a program, rather than a system that guarantees freedom from all types of leakage between variables at all times. Our model may not detect information leaks that occur ...
... In this sense, our aim is to create a model of information leakage that makes it convenient to measure leaks between given points in a program, rather than a system that guarantees freedom from all types of leakage between variables at all times. Our model may not detect information leaks that occur ...
Interactive Privacy via the Median Mechanism
... dependence limits the use of this mechanism to a sublinear k = o(n) number of queries. Can we do better than independent output perturbations? For special classes of queries like predicate queries, Blum, Ligett, and Roth [BLR08] give an affirmative answer (building on techniques of Kasiviswanathan ...
... dependence limits the use of this mechanism to a sublinear k = o(n) number of queries. Can we do better than independent output perturbations? For special classes of queries like predicate queries, Blum, Ligett, and Roth [BLR08] give an affirmative answer (building on techniques of Kasiviswanathan ...
Fast Portscan Detection Using Sequential Hypothesis
... In general, we consider it acceptable to flag any remote host as a scanner if it turns out that that host would never subsequently make a useful connection, where “useful” means successfully established, data transferred, and, to the degree we can determine, the transfer was benign. Clearly, assessi ...
... In general, we consider it acceptable to flag any remote host as a scanner if it turns out that that host would never subsequently make a useful connection, where “useful” means successfully established, data transferred, and, to the degree we can determine, the transfer was benign. Clearly, assessi ...
Proceedings Version
... soundness with respect to efficient forecasters. That is, for any efficient test that is complete, and for any polynomial bound t(·), there exists a universal uniform efficient cheating forecaster that passes the test with high probability for every uniform Nature algorithm that runs in time t(·). R ...
... soundness with respect to efficient forecasters. That is, for any efficient test that is complete, and for any polynomial bound t(·), there exists a universal uniform efficient cheating forecaster that passes the test with high probability for every uniform Nature algorithm that runs in time t(·). R ...
Full Version
... One of our main results is to restore the strong impossibility result of Sandroni ([San03]) in the computationally-bounded setting; that is, we show the following: Theorem 3 (Informal). Any efficient test that is complete cannot even satisfy very weak notions of soundness with respect to efficient f ...
... One of our main results is to restore the strong impossibility result of Sandroni ([San03]) in the computationally-bounded setting; that is, we show the following: Theorem 3 (Informal). Any efficient test that is complete cannot even satisfy very weak notions of soundness with respect to efficient f ...
Portfolio Value-at-Risk Using Regular Vine Copulas
... In risk management there are several approaches to quantify risk. The most modern and consistent approaches are quantile based and therefore it is of interest to understand a portfolio return distribution. Complications may arise when dealing with higher dimensions. There are several methods that al ...
... In risk management there are several approaches to quantify risk. The most modern and consistent approaches are quantile based and therefore it is of interest to understand a portfolio return distribution. Complications may arise when dealing with higher dimensions. There are several methods that al ...
Twenty-One Arguments Against Propensity Analyses of Probability
... scientific theories are not in need of conceptual clarification—that the ‘clear conditions of application’ are sufficient for conceptual understanding). It also suggests that the explicatum replace or eliminate the explicandum; and that satisfying these constraints is enough to show that the initial ...
... scientific theories are not in need of conceptual clarification—that the ‘clear conditions of application’ are sufficient for conceptual understanding). It also suggests that the explicatum replace or eliminate the explicandum; and that satisfying these constraints is enough to show that the initial ...
Probability and Statistics
... individuals originating from identical ova, become very different from each other. In addition, the environment influences the conditions of selection; it thus changes the type both directly and obliquely. As long as such changes are reversible, their study is guided by the principles described abov ...
... individuals originating from identical ova, become very different from each other. In addition, the environment influences the conditions of selection; it thus changes the type both directly and obliquely. As long as such changes are reversible, their study is guided by the principles described abov ...
When Did Bayesian Inference Become “Bayesian”?
... Laplace refined and developed the “Principle” he introduced in 1774 in papers published in 1781 and 1786, and it took on varing forms such as the “indifference principle” or what we now refer to as “Laplace’s Rule of Succession” (for obtaining the probability of new events on the basis of past obser ...
... Laplace refined and developed the “Principle” he introduced in 1774 in papers published in 1781 and 1786, and it took on varing forms such as the “indifference principle” or what we now refer to as “Laplace’s Rule of Succession” (for obtaining the probability of new events on the basis of past obser ...
Probability box
A probability box (or p-box) is a characterization of an uncertain number consisting of both aleatoric and epistemic uncertainties that is often used in risk analysis or quantitative uncertainty modeling where numerical calculations must be performed. Probability bounds analysis is used to make arithmetic and logical calculations with p-boxes.An example p-box is shown in the figure at right for an uncertain number x consisting of a left (upper) bound and a right (lower) bound on the probability distribution for x. The bounds are coincident for values of x below 0 and above 24. The bounds may have almost any shapes, including step functions, so long as they are monotonically increasing and do not cross each other. A p-box is used to express simultaneously incertitude (epistemic uncertainty), which is represented by the breadth between the left and right edges of the p-box, and variability (aleatory uncertainty), which is represented by the overall slant of the p-box.