Sciweavers

2470 search results - page 11 / 494
» Liveness-Preserving Simulation Relations
Sort
View
PKC
2012
Springer
237views Cryptology» more  PKC 2012»
11 years 10 months ago
Relatively-Sound NIZKs and Password-Based Key-Exchange
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...
Charanjit S. Jutla, Arnab Roy
SCP
2010
88views more  SCP 2010»
13 years 6 months ago
Incompleteness of relational simulations in the blocking paradigm
Refinement is the notion of development between formal specifications. For specifications given in a relational formalism, downward and upward simulations are the standard meth...
Eerke A. Boiten, John Derrick
CSFW
2007
IEEE
14 years 2 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
ACSC
2008
IEEE
14 years 2 months ago
Relative simulation and model checking of real-time processes
Simulation and model checking are commonly used to compare the behaviour of a computer-based system with its requirements specification. However, when upgrading an operational le...
Colin J. Fidge
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig