Sciweavers

234 search results - page 7 / 47
» Proof Nets and the Identity of Proofs
Sort
View
ENTCS
2008
79views more  ENTCS 2008»
14 years 10 months ago
Experimenting Formal Proofs of Petri Nets Refinements
Petri nets are a formalism for modelling and validating critical systems. Generally, the approach to specification starts from an abstract view of the system under study. Once val...
Christine Choppy, Micaela Mayero, Laure Petrucci
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
14 years 10 months ago
Non-Commutative Sylvester's Determinantal Identity
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
Matjaz Konvalinka
JCSS
2010
68views more  JCSS 2010»
14 years 8 months ago
Simplified proof of the blocking theorem for free-choice Petri nets
: Every cluster in a bounded and live free-choice system has a unique blocking marking. It can be reached by firing an occurrence sequence, which avoids any transition of the clust...
Joachim Wehler
SCN
2004
Springer
15 years 3 months ago
Identity-Based Zero Knowledge
Abstract. We introduce and define the notion of identity-based zeroknowledge, concentrating on the non-interactive setting. In this setting, our notion allows any prover to widely...
Jonathan Katz, Rafail Ostrovsky, Michael O. Rabin
CRYPTO
2012
Springer
222views Cryptology» more  CRYPTO 2012»
13 years 16 days ago
Secure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
Mark Zhandry