Sciweavers

922 search results - page 161 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
CORR
2006
Springer
176views Education» more  CORR 2006»
13 years 7 months ago
On the Fingerprinting Capacity Under the Marking Assumption
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
ENTCS
2006
136views more  ENTCS 2006»
13 years 7 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
ENTCS
2006
113views more  ENTCS 2006»
13 years 7 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
FUIN
2006
85views more  FUIN 2006»
13 years 7 months ago
Towards Integrated Verification of Timed Transition Models
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
Mark Lawford, Vera Pantelic, Hong Zhang