234 search results - page 17 / 47 » Proof Nets and the Identity of Proofs |
COMBINATORICS
2007
14 years 10 months ago
2007
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial iden...
PLDI
2010
ACM
15 years 7 months ago
2010
ACM
A number of programming languages use rich type systems to verify security properties of code. Some of these languages are meant for source programming, but programs written in th...
86
Voted
DAM
1998
14 years 9 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
110
click to vote
EUC
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. Signcryption is a cryptographic primitive that aims at providing confidentiality and authentication simultaneously. Recently in May 2008, a scheme for identity based thre...
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...