Sciweavers

234 search results - page 19 / 47
» Proof Nets and the Identity of Proofs
Sort
View
CTRSA
2010
Springer
191views Cryptology» more  CTRSA 2010»
15 years 1 months ago
Making the Diffie-Hellman Protocol Identity-Based
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
Dario Fiore, Rosario Gennaro
LPNMR
2001
Springer
15 years 2 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
CCS
2001
ACM
15 years 2 months ago
Events in security protocols
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the ...
Federico Crazzolara, Glynn Winskel
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
14 years 10 months ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
EJC
2008
14 years 10 months ago
On Postnikov's hook length formula for binary trees
We present a combinatorial proof of Postnikov's hook length formula for binary trees. c 2007 Elsevier Ltd. All rights reserved. Let [n] = {1, 2, . . . , n}. It is well known ...
William Y. C. Chen, Laura L. M. Yang