Sciweavers

70 search results - page 6 / 14
» Functional Encryption for Turing Machines
Sort
View
74
Voted
ATAL
2004
Springer
15 years 3 months ago
The Insufficiency of Formal Design Methods - The Necessity of an Experimental Approach - for the Understanding and Control of Co
We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
Bruce Edmonds, Joanna Bryson
FSTTCS
1992
Springer
15 years 1 months ago
Structural Average Case Complexity
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
Rainer Schuler, Tomoyuki Yamakami
NC
2006
130views Neural Networks» more  NC 2006»
14 years 9 months ago
Dynamic self-assembly in living systems as computation
Biochemical reactions taking place in living systems that map different inputs to specific outputs are intuitively recognized as performing information processing. Conventional wis...
Ann M. Bouchard, Gordon C. Osbourn
ECOWS
2006
Springer
15 years 1 months ago
AMPol: Adaptive Messaging Policy
Interoperability in a large-scale distributed system is challenged by by the diversity of node policies. We introduce AMPol (Adaptive Messaging Policy), a serviceoriented architec...
Raja Afandi, Jianqing Zhang, Munawar Hafiz, Carl A...
FSE
2000
Springer
85views Cryptology» more  FSE 2000»
15 years 1 months ago
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
Abstract. We discuss the special requirements imposed on the underlying cipher of systems which encrypt each sector of a disk partition independently, and demonstrate a certificati...
Paul Crowley