Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing spaces. Unfortunately, existing distributed proof protocols offer only limited support for protecting the confidentiality of sensitive facts, which limits their utility in many practical scenarios. In this paper, we prop...

The aim of this paper is to design a proof of knowledge for the factorization of an integer n. We propose a statistical zero-knowledge protocol similar to proofs of knowledge of discrete logarithm a la Schnorr. The eeciency improvement in comparison with the previously known schemes can be compared with the diierence between the Fiat-Shamir scheme and the Schnorr one. Furthermore, the proof can...

In this paper, we propose a grouping-proof protocol for RFID tags based on (n, n)-secret sharing. Our proposed protocol addresses the scalability issue of the previous protocols by removing the need for an RFID reader to relay messages from one tag to another tag. We also present a security model for a secure grouping-proof protocol which properly addresses the so called mafia fraud attack (som...

Mathematics is facing a dilemma at its heart: the nature of mathematical proof. We have known since Church and Turing independently showed that mathematical provability was undecidable that there are theorems whose shortest proofs are enormous. Within the last half-century we have discovered practical examples of such theorems: the classification of all finite simple groups, the Four Colour The...

The notion of isomorphisms of types has many theoretical as well as practical consequences, and isomorphisms of types have been investigated at length over the past years. Isomorphisms in weak system (like linear lambda calculus) have recently been investigated due to their practical interest in library search. In this paper we give a remarkably simple and elegant characterization of linear iso...

Security proof of practical quantum key distribution (QKD) has attracted a lot of attentions in recent years. Most of real-life QKD implementations are based on phase-coding BB84 protocol, which usually uses Unbalanced Mach-Zehnder Interferometer (UMZI) as the information coder and decoder. However, the long arm and short arm of UMZI will introduce different loss in practical experimental reali...

The 0–1 Knapsack problem has been studied extensively during the past four decades. The reason is that it appears in many real domains with practical importance. Although its NP-completeness, many algorithms have been proposed that exhibit impressive behavior in the average case. This paper introduces the problem and presents a proof that it belongs to the NP-complete class, as well as a list o...

Test set induction is a goal-directed proof technique which combines the full power of explicit induction and proof by consistency. It works by computing an appropriate explicit induction scheme called a test set, to trigger the induction proof, and then applies a refutation principle using proof by consistency techniques. We present a general scheme for test set induction together with a simpl...

The topic of this thesis is the relationship between formal and informal proofs. Chapter One opens the discussion by examining what a proof is, when two proofs are identical, what the purpose of proving is and how to distinguish the two categories of proof. Chapters Two and Three focus in on informal and formal proof respectively, with the latter also including descriptions of various computati...

Partial Cylindrical Algebraic Decomposition I: The Lifting Phase Grant Olney Passmore and Paul B. Jackson [email protected], [email protected] 1 Clare Hall, University of Cambridge 2 LFCS, University of Edinburgh Abstract. Though decidable, the theory of real closed fields (RCF) is Though decidable, the theory of real closed fields (RCF) is fundamentally infeasible. This is unfortunate...