164,501 research outputs found
Dynamic Logic of Common Knowledge in a Proof Assistant
Common Knowledge Logic is meant to describe situations of the real world
where a group of agents is involved. These agents share knowledge and make
strong statements on the knowledge of the other agents (the so called
\emph{common knowledge}). But as we know, the real world changes and overall
information on what is known about the world changes as well. The changes are
described by dynamic logic. To describe knowledge changes, dynamic logic should
be combined with logic of common knowledge. In this paper we describe
experiments which we have made about the integration in a unique framework of
common knowledge logic and dynamic logic in the proof assistant \Coq. This
results in a set of fully checked proofs for readable statements. We describe
the framework and how a proof can beComment: 15
Automated Cryptographic Analysis of the Pedersen Commitment Scheme
Aiming for strong security assurance, recently there has been an increasing
interest in formal verification of cryptographic constructions. This paper
presents a mechanised formal verification of the popular Pedersen commitment
protocol, proving its security properties of correctness, perfect hiding, and
computational binding. To formally verify the protocol, we extended the theory
of EasyCrypt, a framework which allows for reasoning in the computational
model, to support the discrete logarithm and an abstraction of commitment
protocols. Commitments are building blocks of many cryptographic constructions,
for example, verifiable secret sharing, zero-knowledge proofs, and e-voting.
Our work paves the way for the verification of those more complex
constructions.Comment: 12 pages, conference MMM-ACNS 201
Well-posedness of the non-local conservation law by stochastic perturbation
Stochastic non-local conservation law equation in the presence of
discontinuous flux functions is considered in an setting. The
flux function is assumed bounded and integrable (spatial variable). Our result
is to prove existence and uniqueness of weak solutions. The solution is strong
solution in the probabilistic sense. The proofs are constructive and based on
the method of characteristics (in the presence of noise), It\^o-Wentzell-Kunita
formula and commutators. Our results are new , to the best of our knowledge,
and are the first nonlinear extension of the seminar paper [20] where the
linear case was addressed.Comment: several corrections were made with respect to the first version.
arXiv admin note: text overlap with arXiv:1702.0597
Recommended from our members
A Complete Problem for Statistical Zero Knowledge
We present the first complete problem for SZK, the class of (promise) problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, called STATISTICAL DIFFERENCE, is to decide whether two efficiently samplable distributions are either statistically close or far apart. This gives a new characterization of SZK that makes no reference to interaction or zero knowledge.
We propose the use of complete problems to unify and extend the study of statistical zero knowledge. To this end, we examine several consequences of our Completeness Theorem and its proof, such as:
* A way to make every (honest-verifier) statistical zero-knowledge proof very communication efficient, with the prover sending only one bit to the verifier (to achieve soundness error 1/2).
* Simpler proofs of many of the previously known results about statistical zero knowledge, such as the Fortnow and Aiello--HĂ„stad upper bounds on the complexity of SZK and Okamoto's result that SZK is closed under complement.
* Strong closure properties of SZK which amount to constructing statistical zero-knowledge proofs for complex assertions built out of simpler assertions already shown to be in SZK.
* New results about the various measures of "knowledge complexity," including a collapse in the hierarchy corresponding to knowledge complexity in the "hint" sense.
* Algorithms for manipulating the statistical difference between efficiently samplable distributions, including transformations which "polarize" and "reverse" the statistical relationship between a pair of distributions.Engineering and Applied Science
Self-Referential Justifications in Epistemic Logic
This paper is devoted to the study of self-referential proofs and/or justifications, i.e.,valid proofs that prove statements about these same proofs. The goal is to investigate whether such self-referential justifications are present in the reasoning described by standard modal epistemic logics such as . We argue that the modal language by itself is too coarse to capture this concept of self-referentiality and that the language of justification logic can serve as an adequate refinement. We consider well-known modal logics of knowledge/belief and show, using explicit justifications, that , , , and with their respective justification counterparts , , , and describe knowledge that is self-referential in some strong sense. We also demonstrate that self-referentiality can be avoided for and . In order to prove the former result, we develop a machinery of minimal evidence functions used to effectively build models for justification logics. We observe that the calculus used to construct the minimal functions axiomatizes the reflected fragments of justification logics. We also discuss difficulties that result from an introduction of negative introspectio
How not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
The Fiat-Shamir transformation is the most efficient construction of non-interactive zero-knowledge proofs.
This paper is concerned with two variants of the transformation that appear but have not been clearly delineated in existing literature. Both variants start with the prover making a commitment. The strong variant then hashes both the commitment and the statement to be proved, whereas the weak variant hashes only the commitment. This minor change yields dramatically different security guarantees: in situations where malicious provers can select their statements adaptively, the weak Fiat-Shamir transformation yields unsound/unextractable proofs. Yet such settings naturally occur in systems when zero-knowledge proofs are used to enforce honest behavior. We illustrate this point by showing that the use of the weak Fiat-Shamir transformation in the Helios cryptographic voting system leads to several possible security breaches: for some standard types of elections, under plausible circumstances, malicious parties can cause the tallying procedure to run indefinitely and even tamper with the result of the election.
On the positive side, we define a form of adaptive security for zero-knowledge proofs in the random oracle model (essentially simulation-sound extractability), and show that a variant which we call strong Fiat-Shamir yields secure non-interactive proofs.
This level of security was assumed in previous works on Helios and our results are then necessary for these analyses to be valid. Additionally, we show that strong proofs in Helios achieve non-malleable encryption and satisfy ballot privacy, improving on previous results that required CCA security
A Study of Separations in Cryptography: New Results and New Models
For more than 20 years, black-box impossibility results have been used to argue the infeasibility of constructing certain cryptographic primitives (e.g., key agreement) from others (e.g., one-way functions). In this dissertation we further extend the frontier of this field by demonstrating several new impossibility results as well as a new framework for studying a more general class of constructions.
Our first two results demonstrate impossibility of black-box constructions of two commonly used cryptographic primitives. In our first result we study the feasibility of black-box constructions of predicate encryption schemes from standard assumptions and demonstrate strong limitations on the types of schemes that can be constructed. In our second result we study black-box constructions of constant-round zero-knowledge proofs from one-way permutations and show that, under commonly believed complexity assumptions, no such constructions exist.
A widely recognized limitation of black-box impossibility results, however, is that they say nothing about the usefulness of (known) non-black-box techniques. This state of affairs is unsatisfying as we would at least like to rule out constructions using the set of techniques we have at our disposal. With this motivation in mind, in the final result of this dissertation we propose a new framework for black-box constructions with a non-black-box flavor, specifically, those that rely on zero-knowledge proofs relative to some oracle. Our framework is powerful enough to capture a large class of known constructions, however we show that the original black-box separation of key agreement from one-way functions still holds even in this non-black-box setting that allows for zero-knowledge proofs
Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
In this work, we first formalize the notion of dynamic group signatures with distributed traceability, where the capability to trace signatures is distributed among n managers without requiring any interaction. This ensures that only the participation of all tracing managers permits tracing a signature, which reduces the trust placed in a single tracing manager. The threshold variant follows easily from our definitions and constructions. Our model offers strong security requirements. Our second contribution is a generic construction for the notion which has a concurrent join protocol, meets strong security requirements, and offers efficient traceability, i.e. without requiring tracing managers to produce expensive zero-knowledge proofs for tracing correctness. To dispense with the expensive zero-knowledge proofs required in the tracing, we deploy a distributed tag-based encryption with public verifiability. Finally, we provide some concrete instantiations, which, to the best of our knowledge, are the first efficient provably secure realizations in the standard model simultaneously offering all the aforementioned properties. To realize our constructions efficiently, we construct an efficient distributed (and threshold) tag-based encryption scheme that works in the efficient Type-III asymmetric bilinear groups. Our distributed tag-based encryption scheme yields short ciphertexts (only 1280 bits at 128-bit security), and is secure under an existing variant of the standard decisional linear assumption. Our tag-based encryption scheme is of independent interest and is useful for many applications beyond the scope of this paper. As a special case of our distributed tag-based encryption scheme, we get an efficient tag-based encryption scheme in Type-III asymmetric bilinear groups that is secure in the standard model
Black-Box Wallets: Fast Anonymous Two-Way Payments for Constrained Devices
Black-box accumulation (BBA) is a building block which enables a privacy-preserving implementation of point collection and redemption, a functionality required in a variety of user-centric applications including loyalty programs, incentive systems, and mobile payments. By definition, BBA+ schemes (Hartung et al. CCS \u2717) offer strong privacy and security guarantees, such as unlinkability of transactions and correctness of the balance flows of all (even malicious) users. Unfortunately, the instantiation of BBA+ presented at CCS \u2717 is, on modern smartphones, just fast enough for comfortable use. It is too slow for wearables, let alone smart-cards. Moreover, it lacks a crucial property: For the sake of efficiency, the user\u27s balance is presented in the clear when points are deducted. This may allow to track owners by just observing revealed balances, even though privacy is otherwise guaranteed. The authors intentionally forgo the use of costly range proofs, which would remedy this problem.
We present an instantiation of BBA+ with some extensions following a different technical approach which significantly improves efficiency. To this end, we get rid of pairing groups, rely on different zero-knowledge and fast range proofs, along with a slightly modified version of Baldimtsi-Lysyanskaya blind signatures (CCS \u2713). Our prototype implementation with range proofs (for 16-bit balances) outperforms BBA+ without range proofs by a factor of 2.5. Moreover, we give estimates showing that smart-card implementations are within reach
Secrecy extraction from no-signalling correlations
Quantum cryptography shows that one can guarantee the secrecy of correlation
on the sole basis of the laws of physics, that is without limiting the
computational power of the eavesdropper. The usual security proofs suppose that
the authorized partners, Alice and Bob, have a perfect knowledge and control of
their quantum systems and devices; for instance, they must be sure that the
logical bits have been encoded in true qubits, and not in higher-dimensional
systems. In this paper, we present an approach that circumvents this strong
assumption. We define protocols, both for the case of bits and for generic
-dimensional outcomes, in which the security is guaranteed by the very
structure of the Alice-Bob correlations, under the no-signalling condition. The
idea is that, if the correlations cannot be produced by shared randomness, then
Eve has poor knowledge of Alice's and Bob's symbols. The present study assumes,
on the one hand that the eavesdropper Eve performs only individual attacks
(this is a limitation to be removed in further work), on the other hand that
Eve can distribute any correlation compatible with the no-signalling condition
(in this sense her power is greater than what quantum physics allows). Under
these assumptions, we prove that the protocols defined here allow extracting
secrecy from noisy correlations, when these correlations violate a Bell-type
inequality by a sufficiently large amount. The region, in which secrecy
extraction is possible, extends within the region of correlations achievable by
measurements on entangled quantum states.Comment: 23 pages, 4 figure
- âŠ