Sciweavers

65 search results - page 10 / 13
» Computationally Sound Abstraction and Verification of Secure...
Sort
View
POPL
2006
ACM
15 years 10 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam
97
Voted
PPOPP
2010
ACM
15 years 6 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
EUROCRYPT
2007
Springer
15 years 1 months ago
Batch Verification of Short Signatures
Abstract. With computer networks spreading into a variety of new environments, the need to authenticate and secure communication grows. Many of these new environments have particul...
Jan Camenisch, Susan Hohenberger, Michael Ø...
CORR
2010
Springer
83views Education» more  CORR 2010»
14 years 9 months ago
Recursive Secret Sharing for Distributed Storage and Information Hiding
Abstract--This paper presents a recursive computational multisecret sharing technique that hides k - 2 secrets of size b each into n shares of a single secret S of size b, such tha...
Abhishek Parakh, Subhash Kak
FM
2006
Springer
153views Formal Methods» more  FM 2006»
15 years 1 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner