Sciweavers

1818 search results - page 71 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 5 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
ALP
1992
Springer
14 years 29 days ago
On the Relation Between Primitive Recursion, Schematization and Divergence
The paper presents a new schematization of in nite families of terms called the primal grammars, based on the notion of primitive recursive rewrite systems. This schematization is...
Miki Hermann
INFORMATICALT
2010
91views more  INFORMATICALT 2010»
13 years 7 months ago
An Expansion of the Neural Network Theory by Introducing Hebb Postulate
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...
Algis Garliauskas
ESOP
2001
Springer
14 years 1 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
CADE
2006
Springer
14 years 9 months ago
On the Strength of Proof-Irrelevant Type Theories
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
Benjamin Werner