Sciweavers

3573 search results - page 544 / 715
» Reasoning about Codata
Sort
View
120
Voted
ECCC
2007
144views more  ECCC 2007»
15 years 3 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
KI
2008
Springer
15 years 3 months ago
Collectives and How They Move: A Tale of Two Classifications
Abstract. Collective phenomena and their associated movement patterns are ubiquitous in everyday life. However, even though we need to be able to reason about these phenomena, espe...
Zena Wood, Antony Galton
LISP
2008
105views more  LISP 2008»
15 years 3 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
ENTCS
2007
95views more  ENTCS 2007»
15 years 3 months ago
Rijndael for Sensor Networks: Is Speed the Main Issue?
We present an implementation of Rijndael for wireless sensor networks running on Eyes sensor nodes. In previous works, Rijndael has not been considered a suitable encryption algor...
Andrea Vitaletti, Gianni Palombizio
ENTCS
2007
95views more  ENTCS 2007»
15 years 3 months ago
Hybridizing a Logical Framework
Logical connectives familiar from the study of hybrid logic can be added to the logical framework LF, a constructive type theory of dependent functions. This extension turns out t...
Jason Reed