Standard Notion Research Articles

Unforgeability of Blind Schnorr in the Limited Concurrency Setting

Blind signature schemes enable a user to obtain a digital signature on a message from a signer without revealing the message itself. Among the most fundamental examples of such a scheme is blind Schnorr, but recent results show that it does not satisfy the standard notion of security against malicious users, One-More Unforgeability (OMUF), as it is vulnerable to the ROS attack. However, blind Schnorr does satisfy the weaker notion of sequential OMUF, in which only one signing session is open at a time, in the Algebraic Group Model (AGM) + Random Oracle Model (ROM), assuming the hardness of the Discrete Logarithm (DL) problem. This paper serves as a first step towards characterizing the security of blind Schnorr in the limited concurrency setting. Specifically, we show that blind Schnorr satisfies OMUF when at most two signing sessions can be concurrently open (in the AGM+ROM, assuming DL). Our argument suggests that it is plausible that blind Schnorr satisfies OMUF for up to polylogarithmically many concurrent signing sessions. Our security proof involves interesting techniques from linear algebra and combinatorics.

Understanding Leakage in Searchable Encryption: a Quantitative Approach

Searchable encryption, or more generally, structured encryption, permits search over encrypted data. It is an important cryptographic tool for securing cloud storage. The standard security notion for structured encryption mandates that a protocol leaks nothing about the data or queries, except for some allowed leakage, defined by the leakage function. This is due to the fact that some leakage is unavoidable for efficient schemes.\\ Unfortunately, it was shown by numerous works that even innocuous-looking leakage can often be exploited by attackers to undermine users' privacy and recover their queries and/or data, despite the structured encryption schemes being provably secure. Nevertheless, the standard security remains the go-to notion used to show the 'security' of structured encryption schemes. While it is not likely that researchers will design practical structured encryption schemes with no leakage, it is not satisfactory that very few works study ways to assess leakage.This work proposes a novel framework to quantify leakage. Our methodology is inspired by the quantitative information flow, and we call our method q-leakage analysis. We show how $q$-leakage analysis is related to the standard security. We also demonstrate the usefulness of q-leakage analysis by analyzing the security of two existing schemes with complex leakage functions.

On submodular prophet inequalities and correlation gap

Prophet inequalities and secretary problems have been extensively studied in recent years due to their elegance, connections to online algorithms, stochastic optimization, and mechanism design problems in game theoretic settings. Rubinstein and Singla [31] developed a notion of combinatorial prophet inequalities in order to generalize the standard prophet inequality setting to combinatorial valuation functions such as submodular and subadditive functions. For non-negative submodular functions they demonstrated a constant factor prophet inequality for matroid constraints. Along the way they showed a variant of the correlation gap for non-negative submodular functions.In this paper we revisit their notion of correlation gap as well as the standard notion of correlation gap and prove much tighter and cleaner bounds. Via these bounds and other insights we obtain substantially improved constant factor combinatorial prophet inequalities for both monotone and non-monotone submodular functions over any constraint that admits an Online Contention Resolution Scheme. In addition to improved bounds we describe efficient polynomial-time algorithms that achieve these bounds.

Zjednodušující předpoklady v nekauzálních vysvětleních

Scientific knowledge relies heavily on models, shaped by simplifying assumptions, with common categories being abstraction and idealization. This article aims to expose conceptual challenges inherent in conventional interpretations of these concepts, particularly in their practical application to scientific modeling. The primary hurdle emerges in applying these categories to real­world instances of scientific modeling, which we illustrate with examples of non­causal explanations. Key issues revolve around (i) the ambiguous distinction between abstraction and idealization and (ii) the application of the simplifying assumption of abstraction. Our hypothesis posits that non­causal explanations face unintelligibility due to an unclear understanding of the role of simplifying assumptions in them. To test this, we analyze selected examples, ranging from (toy­)examples to real­world instances, scrutinizing the alignment with the standard notions of abstraction and idealization. Throughout, we investigate the influence of simplifying assumptions on these explanations, assessing their adherence or deviation from conventional concepts.

The Evolution of the Bell Notion of Beable: From Bohr to Primitive Ontology

AbstractJohn S. Bell introduced the notion of beable, as opposed to the standard notion of observable, in order to emphasize the need for an unambiguous formulation of quantum mechanics. In the paper I show that Bell formulated in fact two different theories of beables. The first is somehow reminiscent of the Bohr views on quantum mechanics but, at the same time, is curiously adopted by Bell as a critical tool against the Copenhagen interpretation, whereas the second, more mature formulation was among the sources of inspiration of the so-called Primitive Ontology (PO) approach to quantum mechanics, an approach inspired to scientific realism. In the first part of the paper it is argued that, contrary to the Bell wishes, the first formulation of the theory fails to be an effective recipe for addressing the ambiguity underlying the standard formulation of quantum mechanics, whereas it is only the second formulation that successfully paves the way to the PO approach. In the second part, I consider how the distinction between the two formulations of the Bell theory of beables fares vis-a-vis the complex relationship between the theory of beables and the details of the PO approach.

Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis

A variant of the standard notion of branching bisimilarity for processes with discrete relative timing is proposed which is coarser than the standard notion. Using a version of ACP (Algebra of Communicating Processes) with abstraction for processes with discrete relative timing, it is shown that the proposed variant allows of both the functional correctness and the performance properties of the PAR (Positive Acknowledgement with Retransmission) protocol to be analyzed. In the version of ACP concerned, the difference between the standard notion of branching bisimilarity and its proposed variant is characterized by a single axiom schema.

Imprecision in martingale- and test-theoretic prequential randomness

In a prequential approach to algorithmic randomness, probabilities for the next outcome can be forecast ‘on the fly’ without the need for fully specifying a probability measure on all possible sequences of outcomes, as is the case in the more standard approach. We take the first steps in allowing for probability intervals instead of precise probabilities on this prequential approach, based on ideas borrowed from our earlier imprecise-probabilistic, standard account of algorithmic randomness. We define what it means for an infinite sequence (I1,x1,I2,x2,…) of successive interval forecasts Ik and subsequent binary outcomes xk to be random, both in a martingale-theoretic and a test-theoretic sense. We prove that these two versions of prequential randomness coincide, we compare the resulting prequential randomness notions with the more standard ones, and we investigate where the prequential and standard randomness notions coincide.

Dynamism of context: A case of joke interpretation

Abstract While the recognition of context as a dynamic construct is pervasive, the process of selecting context during utterance comprehension in real time remains largely unexamined. This paper addresses this issue by exploring the dynamism of context as part of joke interpretation. We assume a relevance-theoretic definition of context understood as a set of mental representations involved in inferential processes that operate on a propositionally incomplete linguistic form and yield a speaker-intended meaning, consisting of the explicit and implicit import. We also adopt a model of joke comprehension combining the standard notion of incongruity resolution with that of weak communication, positing that when the punchline comes there is a broad array of assumptions that suddenly become manifest to the hearer, as a result of which he experiences an effect of inferential overload. This effect hinges on the ability to obtain access to, or to inferentially construct contextual assumptions that were previously not immediately accessible to the hearer or not represented in their cognitive resources at all. By analysing jokes of various structure (with or without a build-up, one-liners) we explore details of the dynamism of context selection and construction, in which the hearer’s encyclopaedic knowledge is essential. We provide arguments in favour of the view of context as an entity dependent on the hearer’s mental representations, inferential abilities and the universal drive to maximize relevance in utterance comprehension.

The Classical-Quantum Limit

The standard notion of a classical limit, represented schematically by ℏ→0, provides a method for approximating a quantum system by a classical one. In this work, we explain why the standard classical limit fails when applied to subsystems, and show how one may resolve this by explicitly modeling the decoherence of a subsystem by its environment. Denoting the decoherence time by τ, we demonstrate that a double scaling limit in which ℏ→0 and τ→0 such that the ratio Ef=ℏ/τ remains fixed leads to an irreversible open-system evolution with well-defined classical and quantum subsystems. The main technical result is showing that, for arbitrary Hamiltonians, the generators of partial versions of the Wigner, Husimi, and Glauber-Sudarshan quasiprobability distributions may all be mapped in the above-mentioned double scaling limit to the same completely positive classical-quantum generator. This provides a regime in which one can study effective and consistent classical-quantum dynamics. Published by the American Physical Society 2024

Quantitative Bounds on Resource Usage of Probabilistic Programs

Cost analysis, also known as resource usage analysis, is the task of finding bounds on the total cost of a program and is a well-studied problem in static analysis. In this work, we consider two classical quantitative problems in cost analysis for probabilistic programs. The first problem is to find a bound on the expected total cost of the program. This is a natural measure for the resource usage of the program and can also be directly applied to average-case runtime analysis. The second problem asks for a tail bound, i.e. ‍given a threshold t the goal is to find a probability bound p such that ℙ[total cost ≥ t ] ≤ p . Intuitively, given a threshold t on the resource, the problem is to find the likelihood that the total cost exceeds this threshold. First, for expectation bounds, a major obstacle in previous works on cost analysis is that they can handle only non-negative costs or bounded variable updates. In contrast, we provide a new variant of the standard notion of cost martingales, that allows us to find expectation bounds for a class of programs with general positive or negative costs and no restriction on the variable updates. More specifically, our approach is applicable as long as there is a lower bound on the total cost incurred along every path. Second, for tail bounds, all previous methods are limited to programs in which the expected total cost is finite. In contrast, we present a novel approach, based on a combination of our martingale-based method for expectation bounds with a quantitative safety analysis, to obtain a solution to the tail bound problem that is applicable even to programs with infinite expected cost. Specifically, this allows us to obtain runtime tail bounds for programs that do not terminate almost-surely. In summary, we provide a novel combination of martingale-based cost analysis and quantitative safety analysis that is able to find expectation and tail cost bounds for probabilistic programs, without the restrictions of non-negative costs, bounded updates, or finiteness of the expected total cost. Finally, we provide experimental results showcasing that our approach can solve instances that were beyond the reach of previous methods.

Adversities in Abstract Interpretation - Accommodating Robustness by Abstract Interpretation

Robustness is a key and desirable property of any classifying system, in particular, to avoid the ever-rising threat of adversarial attacks. Informally, a classification system is robust when the result is not affected by the perturbation of the input. This notion has been extensively studied, but little attention has been dedicated to how the perturbation affects the classification. The interference between perturbation and classification can manifest in many different ways, and its understanding is the main contribution of the present article. Starting from a rigorous definition of a standard notion of robustness, we build a formal method for accommodating the required degree of robustness—depending on the amount of error the analyst may accept on the classification result. Our idea is to precisely model this error as an abstraction . This leads us to define weakened forms of robustness also in the context of programming languages, particularly in language-based security, e.g., information-flow policies, and in program verification. The latter is possible by moving from a quantitative (standard) model of perturbation to a novel qualitative model, given by means of the notion of abstraction. As in language-based security, we show that it is possible to confine adversities, which means to characterize the degree of perturbation (and/or the degree of class generalization) for which the classifier may be deemed adequately robust. We conclude with an experimental evaluation of our ideas, showing how weakened forms of robustness apply to state-of-the-art image classifiers.

Generalized charges, part I: Invertible symmetries and higher representations

qq-charges describe the possible actions of a generalized symmetry on qq-dimensional operators. In Part I of this series of papers, we describe qq-charges for invertible symmetries; while the discussion of qq-charges for non-invertible symmetries is the topic of Part II. We argue that qq-charges of a standard global symmetry, also known as a 0-form symmetry, correspond to the so-called (q+1)(q+1)-representations of the 0-form symmetry group, which are natural higher-categorical generalizations of the standard notion of representations of a group. This generalizes already our understanding of possible charges under a 0-form symmetry! Just like local operators form representations of the 0-form symmetry group, higher-dimensional extended operators form higher-representations. This statement has a straightforward generalization to other invertible symmetries: qq-charges of higher-form and higher-group symmetries are (q+1)(q+1)-representations of the corresponding higher-groups. There is a natural extension to higher-charges of non-genuine operators (i.e. operators that are attached to higher-dimensional operators), which will be shown to be intertwiners of higher-representations. This brings into play the higher-categorical structure of higher-representations. We also discuss higher-charges of twisted sector operators (i.e. operators that appear at the boundary of topological operators of one dimension higher), including operators that appear at the boundary of condensation defects.

A Sequentially Fair Mechanism for Multiple Sensitive Attributes

In the standard use case of Algorithmic Fairness, the goal is to eliminate the relationship between a sensitive variable and a corresponding score. Throughout recent years, the scientific community has developed a host of definitions and tools to solve this task, which work well in many practical applications. However, the applicability and effectivity of these tools and definitions becomes less straightfoward in the case of multiple sensitive attributes. To tackle this issue, we propose a sequential framework, which allows to progressively achieve fairness across a set of sensitive features. We accomplish this by leveraging multi-marginal Wasserstein barycenters, which extends the standard notion of Strong Demographic Parity to the case with multiple sensitive characteristics. This method also provides a closed-form solution for the optimal, sequentially fair predictor, permitting a clear interpretation of inter-sensitive feature correlations. Our approach seamlessly extends to approximate fairness, enveloping a framework accommodating the trade-off between risk and unfairness. This extension permits a targeted prioritization of fairness improvements for a specific attribute within a set of sensitive attributes, allowing for a case specific adaptation. A data-driven estimation procedure for the derived solution is developed, and comprehensive numerical experiments are conducted on both synthetic and real datasets. Our empirical findings decisively underscore the practical efficacy of our post-processing approach in fostering fair decision-making.

Virtual Quantum Resource Distillation.

Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted "free" operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call "virtual resource distillation," provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.

Better Late than Never: On Epistemic Diagnosability of Discrete Event Systems

We investigate the diagnosability verification problem in the framework of discrete-event systems. Most of the existing works on this topic assume that faults are related to the internal behaviors of the system such as occurrences of particular events. In this work, motivated by information-flow security considerations, we model faults as some critical information leakages of the system to an intruder, which may have different observations from the system user. Specifically, we say that a fault occurs if the intruder knows that the system has passed by a secret state. We present a formal notion called epistemic diagnosability to capture whether or not the system user can always detect, based on its own observation, the critical information leakage to an intruder within a bounded delay. We show that this new notion subsumes the standard notion of event-based diagnosability. Furthermore, an effective algorithm is provided to verify this new notion.

Non-existence of spontaneous symmetry breakdown of time-translation symmetry on general quantum systems: Any macroscopic order parameter moves not!

The Kubo–Martin–Schwinger (KMS) condition is a well-founded general definition of equilibrium states on quantum systems. The time invariance property of equilibrium states is one of its basic consequences. From the time invariance of any equilibrium state it follows that the spontaneous breakdown of time-translation symmetry is impossible. Moreover, triviality of the temporal long-range order is derived from the KMS condition. Therefore, the manifestation of genuine quantum time crystals is impossible as long as the standard notion of spontaneous symmetry breakdown is considered.

Ehrhart theory of paving and panhandle matroids

Abstract We show that the base polytope P M of any paving matroid M can be systematically obtained from a hypersimplex by slicing off certain subpolytopes, namely base polytopes of lattice path matroids corresponding to panhandle-shaped Ferrers diagrams. We calculate the Ehrhart polynomials of these matroids and consequently write down the Ehrhart polynomial of P M , starting with Katzman’s formula for the Ehrhart polynomial of a hypersimplex. The method builds on and generalizes Ferroni’s work on sparse paving matroids. Combinatorially, our construction corresponds to constructing a uniform matroid from a paving matroid by iterating the operation of stressed-hyperplane relaxation introduced by Ferroni, Nasr and Vecchi, which generalizes the standard matroid-theoretic notion of circuit-hyperplane relaxation. We present evidence that panhandle matroids are Ehrhart positive and describe a conjectured combinatorial formula involving chain forests and Eulerian numbers from which Ehrhart positivity of panhandle matroids will follow. As an application of the main result, we calculate the Ehrhart polynomials of matroids associated with Steiner systems and finite projective planes, and show that they depend only on their design-theoretic parameters: for example, while projective planes of the same order need not have isomorphic matroids, their base polytopes must be Ehrhart equivalent.

Symmetric mechanism design: Comment

In an earlier paper published in this journal, Azrieli and Jain (2018) claim that a social choice function (SCF) is symmetrically implementable in a dominant strategy equilibrium only if the SCF is symmetric. This result crucially relies on their notion of dominant strategy, which is used in the game theory literature and is stronger than the one traditionally used in the mechanism design literature. We discuss the limitation of using their notion in mechanism design and provide a set of characterizations of symmetric mechanism design using the (weaker) standard notion that differ from their findings.

Master Bellman equation in the Wasserstein space: Uniqueness of viscosity solutions

We study the Bellman equation in the Wasserstein space arising in the study of mean field control problems, namely stochastic optimal control problems for McKean-Vlasov diffusion processes. Using the standard notion of viscosity solution à la Crandall-Lions extended to our Wasserstein setting, we prove a comparison result under general conditions on the drift and reward coefficients, which coupled with the dynamic programming principle, implies that the value function is the unique viscosity solution of the Master Bellman equation. This is the first uniqueness result in such a second-order context. The classical arguments used in the standard cases of equations in finite-dimensional spaces or in infinite-dimensional separable Hilbert spaces do not extend to the present framework, due to the awkward nature of the underlying Wasserstein space. The adopted strategy is based on finite-dimensional approximations of the value function obtained in terms of the related cooperative n n -player game, and on the construction of a smooth gauge-type function, built starting from a regularization of a sharp estimate of the Wasserstein metric; such a gauge-type function is used to generate maxima/minima through a suitable extension of the Borwein-Preiss generalization of Ekeland’s variational principle on the Wasserstein space.

Crystal plasticity model of BCC metals from large-scale MD simulations

Accurate crystal plasticity models that faithfully capture the behavior of single crystals under a wide range of loading conditions, such as loading direction, strain rate, and temperature, are still lacking. Here we introduce a novel approach in which a crystal plasticity (CP) model is informed directly from and calibrated to large-scale quantum-accurate MD simulations in which single crystal BCC Ta serves as a testbed material. By analyzing our large set of MD simulations several key insights are obtained leading us to modify constitutive assumptions in order to address deficiencies of existing CP models. Importantly, we observe that the standard notion of fixed slip systems – pairs of slip directions and slip planes – is inadequate for describing high-rate plasticity in BCC tantalum at room temperature. Instead, pencil glide defined as dislocation motion in the maximum resolved shear stress planes (MRSSP) of each Burgers vector is fully consistent with our MD simulation data while providing significant simplifications of the constitutive relations. Our resulting new CP model closely matches the behavior of single crystals observed in high-rate MD simulations while being fully consistent with lower rate experimental results.