Sciweavers

3328 search results - page 212 / 666
» On Plateaued Functions and Their Constructions
Sort
View
FSTTCS
2005
Springer
16 years 3 days ago
Quantitative Models and Implicit Complexity
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
Ugo Dal Lago, Martin Hofmann
FSE
2004
Springer
167views Cryptology» more  FSE 2004»
15 years 12 months ago
Nonce-Based Symmetric Encryption
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function E of the message M and the key K: the user su...
Phillip Rogaway
CGO
2003
IEEE
15 years 12 months ago
Hiding Program Slices for Software Security
Given the high cost of producing software, development of technology for prevention of software piracy is important for the software industry. In this paper we present a novel app...
Xiangyu Zhang, Rajiv Gupta
ECOOP
2000
Springer
15 years 11 months ago
Towards a Unified Programming Language
The goal of research in programming languages should be to develop languages that integrates the best of concepts and constructs from the various programming paradigms. We do not a...
Ole Lehrmann Madsen
AIPS
2007
15 years 9 months ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris