Sciweavers

234 search results - page 12 / 47
» Proof Nets and the Identity of Proofs
Sort
View
EUROCRYPT
2006
Springer
15 years 1 months ago
Practical Identity-Based Encryption Without Random Oracles
We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems
Craig Gentry
COMBINATORICS
2000
94views more  COMBINATORICS 2000»
14 years 10 months ago
A Determinant of the Chudnovskys Generalizing the Elliptic Frobenius-Stickelberger-Cauchy Determinantal Identity
Abstract. D.V. Chudnovsky and G.V. Chudnovsky [CH] introduced a generalization of the FrobeniusStickelberger determinantal identity involving elliptic functions that generalize the...
Tewodros Amdeberhan
CSL
2005
Springer
15 years 3 months ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 10 months ago
Graphical Presentations of Symmetric Monoidal Closed Theories
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...
Richard H. G. Garner, Tom Hirschowitz, Auré...
CORR
2008
Springer
91views Education» more  CORR 2008»
14 years 10 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli