Sciweavers

2436 search results - page 34 / 488
» Comonadic Notions of Computation
Sort
View
EUROCRYPT
2009
Springer
14 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
LICS
2002
IEEE
14 years 2 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
RTA
2010
Springer
14 years 1 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
IJCINI
2007
110views more  IJCINI 2007»
13 years 9 months ago
Toward Autonomic Computing: Adaptive Neural Network for Trajectory Planning
: The theme of this issue of IJCINI is on cognitive mechanisms of autonomic computing and laws of human cooperative work organization. This editorial addresses key notions of this ...
Amar Ramdane-Cherif
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
14 years 1 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali