Sciweavers

201 search results - page 30 / 41
» Security Properties of Typed Applets
Sort
View
FSTTCS
2003
Springer
14 years 28 days ago
Moderately Hard Functions: From Complexity to Spam Fighting
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Moni Naor
POPL
2006
ACM
14 years 8 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
CCS
2011
ACM
12 years 7 months ago
PaperSpeckle: microscopic fingerprinting of paper
Paper forgery is among the leading causes of corruption in many developing regions [2]. In this paper, we introduce PaperSpeckle, a robust system that leverages the natural random...
Ashlesh Sharma, Lakshminarayanan Subramanian, Eric...
CCS
2009
ACM
14 years 8 months ago
A new hash family obtained by modifying the SHA-2 family
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 des...
Somitra Kumar Sanadhya, Palash Sarkar
CADE
2008
Springer
14 years 8 months ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic