Sciweavers

1656 search results - page 251 / 332
» Secure Computation Without Authentication
Sort
View
TYPES
2004
Springer
14 years 2 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
CCS
2004
ACM
14 years 2 months ago
Comparing the expressive power of access control models
Comparing the expressive power of access control models is recognized as a fundamental problem in computer security. Such comparisons are generally based on simulations between di...
Mahesh V. Tripunitara, Ninghui Li
EDBT
2008
ACM
112views Database» more  EDBT 2008»
14 years 9 months ago
Providing freshness guarantees for outsourced databases
Database outsourcing becomes increasingly attractive as advances in network technologies eliminate the perceived performance difference between in-house databases and outsourced d...
Min Xie, Haixun Wang, Jian Yin, Xiaofeng Meng
FC
2010
Springer
169views Cryptology» more  FC 2010»
14 years 7 days ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea
VIZSEC
2004
Springer
14 years 2 months ago
Visualizing windows executable viruses using self-organizing maps
This paper concentrates on visualizing computer viruses without using virus specific signature information as a prior stage of the very important problem of detecting computer vi...
InSeon Yoo