Sciweavers

797 search results - page 115 / 160
» Eliminating Proofs from Programs
Sort
View
IFIP
2010
Springer
13 years 4 months ago
Reasoning about Probabilistic Security Using Task-PIOAs
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
Aaron D. Jaggard, Catherine Meadows, Michael Mislo...
POPL
2010
ACM
14 years 7 months ago
Pure Subtype Systems
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
DeLesley S. Hutchins
SIGMOD
2005
ACM
127views Database» more  SIGMOD 2005»
14 years 10 months ago
Fossilized Index: The Linchpin of Trustworthy Non-Alterable Electronic Records
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
Qingbo Zhu, Windsor W. Hsu
PET
2010
Springer
14 years 1 months ago
Making a Nymbler Nymble Using VERBS
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
Ryan Henry, Kevin Henry, Ian Goldberg
IACR
2011
162views more  IACR 2011»
12 years 9 months ago
The Parazoa Family: Generalizing the Sponge Hash Functions
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...
Elena Andreeva, Bart Mennink, Bart Preneel