Sciweavers

11 search results - page 1 / 3
» On the Equivalence of Several Security Notions of KEM and DE...
Sort
View
38
Voted
IEICET
2008
50views more  IEICET 2008»
14 years 11 months ago
On the Equivalence of Several Security Notions of KEM and DEM
Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto
84
Voted
CSFW
1999
IEEE
15 years 3 months ago
Process Algebra and Non-Interference
The information security community has long debated the exact definition of the term `security'. Even if we focus on the more modest notion of confidentiality the precise def...
Peter Y. A. Ryan, Steve A. Schneider
86
Voted
CSFW
2009
IEEE
15 years 5 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
ICDE
2007
IEEE
1577views Database» more  ICDE 2007»
16 years 10 months ago
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
The k-anonymity privacy requirement for publishing microdata requires that each equivalence class (i.e., a set of records that are indistinguishable from each other with respect to...
Ninghui Li, Tiancheng Li, Suresh Venkatasubramania...
94
Voted
ASIACRYPT
2000
Springer
15 years 3 months ago
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
Anand Desai, Sara K. Miner