Sciweavers

1770 search results - page 42 / 354
» Writing requirements in computer security
Sort
View
CSFW
2007
IEEE
14 years 2 months ago
Approximated Computationally Bounded Simulation Relations for Probabilistic Automata
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
Roberto Segala, Andrea Turrini
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
MKM
2004
Springer
14 years 1 months ago
Flexible Encoding of Mathematics on the Computer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
Fairouz Kamareddine, Manuel Maarek, J. B. Wells
CRYPTO
2001
Springer
95views Cryptology» more  CRYPTO 2001»
14 years 5 days ago
Robustness for Free in Unconditional Multi-party Computation
We present a very efficient multi-party computation protocol unconditionally secure against an active adversary. The security is maximal, i.e., active corruption of up to t < n/...
Martin Hirt, Ueli M. Maurer
INFOCOM
2008
IEEE
14 years 2 months ago
A Practical and Flexible Key Management Mechanism For Trusted Collaborative Computing
—Trusted Collaborative Computing (TCC) is a new research and application paradigm. Two important challenges in such a context are represented by secure information transmission a...
Xukai Zou, Yuan-Shun Dai, Elisa Bertino