We present an extension of the first proof for the unconditional security of the BB84 quantum key distribution protocol which was given by Mayers. We remove the constraint that a perfect BB84 quantum source is required and the proof given here covers a range of practical quantum sources. Nothing is assumed about the detector except that the efficiency with which signals are detected is basis in...

We construct a proof of membership protocol that uses log 2 t steps to prove an element to have the structure a 2 t (modn) given public values n; a; t where n is the product of two large secret primes. Such a proof serves a concrete basis of trust for a time-lock puzzle scheme and its applications in timed-release cryptography. The achieved ef-ciency expressed in log 2 t (number of modulo expon...

We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques, based for instance on clause learning. We have implemented a proof generator for propositional logic...

The Naor-Yung (NY) paradigm shows how to build a chosen-ciphertext secure encryption scheme from three conceptual ingredients: a weakly (i.e., IND-CPA) secure encryption scheme, a replication strategy that speci es how to use the weakly secure encryption scheme; concretely, a NY-encryption contains several weak encryptions of the same plaintext, a non-interactive zero-knowledge (NIZK) proof sys...

The Naor-Yung (NY) paradigm shows how to build a chosen-ciphertext secure encryption scheme from three conceptual ingredients: a weakly (i.e., IND-CPA) secure encryption scheme, a replication strategy that speci es how to use the weakly secure encryption scheme; concretely, a NY-encryption contains several weak encryptions of the same plaintext, a non-interactive zero-knowledge (NIZK) proof sys...

We construct a proof of membership protocol that uses log2 t steps to prove an element to have the structure a t (modn) given public values n; a; t where n is the product of two large secret primes. Such a proof serves a concrete basis of trust for a time-lock puzzle scheme and its applications in timed-release cryptography. The achieved efciency expressed in log2 t (number of modulo exponentia...

A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verifiable is to give a zero-knowledge proof of correctness. All currently known practical zero-knowledge proofs for correctness of a shuffle rely on interaction. We give the first efficient non-interactive zeroknowledge p...

We describe the formalization of a certified algorithm for regular expression parsing based on Brzozowski derivatives, in the dependently typed language Idris. The formalized algorithm produces a proof that an input string matches a given regular expression or a proof that no matching exists. A tool for regular expression based search in the style of the well known GNU grep has been developed w...

background:  ramsar, a northern city in iran, lies on the coast of the caspian sea. this city has areas with some of the highest levels of natural radiation measured to date. the radon concentration in some areas of ramsar is up to 3700 bq m–3. on the other hand, due to high level of humidity, damp-proof barriers should be used in construction of new buildings in radon prone areas of this city....