Sciweavers

208 search results - page 1 / 42
» Realization using the model existence theorem
Sort
View
ALIFE
2007
13 years 4 months ago
Computational Realizations of Living Systems
Robert Rosen’s central theorem states that organisms are fundamentally different to machines, mainly because they are ‘‘closed with respect to effcient causation.’’ The p...
Dominique Chu, Weng Kin Ho
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
13 years 11 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
SIGSOFT
2010
ACM
13 years 2 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan
CSFW
2008
IEEE
13 years 11 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
JSYML
2007
79views more  JSYML 2007»
13 years 4 months ago
Models of non-well-founded sets via an indexed final coalgebra theorem
The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of ...
Federico De Marchi, Benno van den Berg