Results 1  10
of
3,171
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 898 (50 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
The inductive approach to verifying cryptographic protocols
 Journal of Computer Security
, 1998
"... Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinitestate systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as ..."
Abstract

Cited by 480 (29 self)
 Add to MetaCart
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinitestate systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can
Establishing Pairwise Keys in Distributed Sensor Networks
, 2003
"... Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques such as ..."
Abstract

Cited by 543 (29 self)
 Add to MetaCart
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. However, due to the resource constraints on sensors, it is infeasible to use traditional key management techniques
Matrix Polynomials
, 1982
"... Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights into the sensitivit ..."
Abstract

Cited by 304 (9 self)
 Add to MetaCart
Abstract. The pseudospectra of a matrix polynomial P (λ) are sets of complex numbers that are eigenvalues of matrix polynomials which are near to P (λ), i.e., their coefficients are within some fixed magnitude of the coefficients of P (λ). Pseudospectra provide important insights
Approximation Algorithms for Connected Dominating Sets
 Algorithmica
, 1996
"... The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size, whe ..."
Abstract

Cited by 366 (9 self)
 Add to MetaCart
The dominating set problem in graphs asks for a minimum size subset of vertices with the following property: each vertex is required to either be in the dominating set, or adjacent to some node in the dominating set. We focus on the question of finding a connected dominating set of minimum size
On the (im)possibility of obfuscating programs
 Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract

Cited by 348 (24 self)
 Add to MetaCart
Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic
Some Combinatorial Properties of Schubert Polynomials
, 1993
"... Schubert polynomials were introduced by Bernstein Gelfand Gelfand and De mazure, and were extensively developed by Lascoux, Schiitzenberger, Macdonald, and others. We give an explicit combinatorial interpretation of the Schubert polyno mial in terms of the reduced decompositions of the permutation ..."
Abstract

Cited by 158 (11 self)
 Add to MetaCart
Schubert polynomials were introduced by Bernstein Gelfand Gelfand and De mazure, and were extensively developed by Lascoux, Schiitzenberger, Macdonald, and others. We give an explicit combinatorial interpretation of the Schubert polyno mial in terms of the reduced decompositions
Faulttolerant quantum computation
 In Proc. 37th FOCS
, 1996
"... It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information i ..."
Abstract

Cited by 264 (5 self)
 Add to MetaCart
as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1 / log c t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1 /t). We do this by showing that operations can be performed
Classification of Quasigroupstructures with respect to their Cryptographic Properties
"... Computationally simple but cryptographically strong ciphers play an important role for efficient Computer Security tasks. It is suggested in (Knapskog, 2008) that there is a need for simple cryptographic primitives to implement security in an environment with end users connected with terminals havin ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Computationally simple but cryptographically strong ciphers play an important role for efficient Computer Security tasks. It is suggested in (Knapskog, 2008) that there is a need for simple cryptographic primitives to implement security in an environment with end users connected with terminals
Results 1  10
of
3,171