Related papers: On the Composition of Two-Prover Commitments, and …
In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…
We investigate two-party cryptographic protocols that are secure under assumptions motivated by physics, namely relativistic assumptions (no-signalling) and quantum mechanics. In particular, we discuss the security of bit commitment in…
There exists a vast number of adversarial attacks and defences for machine learning algorithms of various types which makes assessing the robustness of algorithms a daunting task. To make matters worse, there is an intrinsic bias in these…
The Recurrence Axiom for a class $\mathcal{P}$ of \pos\ and a set $A$ of parameters is an axiom scheme in the language of ZFC asserting that if a statement with parameters from $A$ is forced by a poset in $\mathcal{P}$, then there is a…
In this paper, we propose an easy-to-implement residual-based specification testing procedure for detecting structural changes in factor models, which is powerful against both smooth and abrupt structural changes with unknown break dates.…
Probabilities of the outcomes of consecutive quantum measurements can be obtained by construction probability amplitudes, thus implying unitary evolution of the measured system, broken each time a measurement is made. In practice, the…
Single-turn safety evaluation is a poor proxy for real fraud defense, where attackers escalate across multiple rounds. This paper evaluates fraud defenders under replay and adaptive multi-round attacks and measures when a defender refuses,…
We provide a framework to bound the probability that accumulated errors were never above a given threshold on hybrid systems. Such systems are used for example to model an aircraft or a nuclear power plant on one side and its software on…
Static verification relying on an automated theorem prover can be very slow and brittle: since static verification is undecidable, correct code may not pass a particular static verifier. In this work we use metaprogramming to generate code…
Inverse linear programming (LP) has received increasing attention due to its potential to generate efficient optimization formulations that can closely replicate the behavior of a complex system. However, inversely inferred parameters and…
Adversarial examples pose a security threat to many critical systems built on neural networks (such as face recognition systems, and self-driving cars). While many methods have been proposed to build robust models, how to build certifiably…
We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to…
Recently,D.Mondal et.al[Phys. Rev. A. 95, 052117(2017)]creatively introduce a new interesting concept of reverse uncertainty relation which indicates that one cannot only prepare quantum states with joint small uncertainty, but also with…
This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this…
Wyner's soft-covering lemma is the central analysis step for achievability proofs of information theoretic security, resolvability, and channel synthesis. It can also be used for simple achievability proofs in lossy source coding. This work…
Bit commitment is a fundamental cryptographic primitive in which Alice wishes to commit a secret bit to Bob. Perfectly secure bit commitment between two mistrustful parties is impossible through asynchronous exchange of quantum information.…
Our general aim is to give sufficient conditions for robustness behavior and convergence to the equilibrium point of linear time-varying fractional system's solutions. We approach this problem using as a framework a series of recent results…
In this work we show that a relativistic spinning particle can be described at the classical and the quantum level as being composed of two physical constituents which are entangled and separated by a fixed distance. This bilocal model for…
This work proposes a novel theoretical framework of robust limit analysis i.e. the computation of limit loads of structures in presence of uncertainties using limit analysis and robust optimization theories. We first derive generic robust…
In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard…