Sciweavers

5476 search results - page 279 / 1096
» Resettably Secure Computation
Sort
View
JOC
2002
76views more  JOC 2002»
15 years 6 months ago
A Note on Negligible Functions
In theoretical cryptography, one formalizes the notion of an adversary's success probability being "too small to matter" by asking that it be a negligible function ...
Mihir Bellare
PROVSEC
2010
Springer
15 years 4 months ago
Distinguishing Distributions Using Chernoff Information
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
Thomas Baignères, Pouyan Sepehrdad, Serge V...
IJNSEC
2010
145views more  IJNSEC 2010»
15 years 1 months ago
Formal Specification of Common Criteria Based Access Control Policy Model
One of the major threats that an enterprise Information system networks are facing today is the Insider threat. As part of the Insider Threat study, lack of an effective access co...
Manpreet Singh, Manjeet S. Patterh
SIGMOD
2012
ACM
278views Database» more  SIGMOD 2012»
13 years 9 months ago
Differential privacy in data publication and analysis
Data privacy has been an important research topic in the security, theory and database communities in the last few decades. However, many existing studies have restrictive assumpt...
Yin Yang, Zhenjie Zhang, Gerome Miklau, Marianne W...
ICIP
2007
IEEE
16 years 8 months ago
Enabling Better Medical Image Classification Through Secure Collaboration
Privacy is of growing concern in today's day and age. Protecting the privacy of health data is of paramount importance. With the rapid advancement in imaging technology, anal...
Jaideep Vaidya, Bhakti Tulpule