Sciweavers

718 search results - page 78 / 144
» Security protocols, properties, and their monitoring
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 11 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ISW
2010
Springer
15 years 4 months ago
Efficient Computationally Private Information Retrieval from Anonymity or Trapdoor Groups
A Private Information Retrieval (PIR) protocol allows a database user, or client, to obtain information from a data- base in a manner that prevents the database from knowing which...
Jonathan T. Trostle, Andy Parrish
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 4 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
IWSEC
2009
Springer
16 years 21 days ago
Reducing Complexity Assumptions for Oblivious Transfer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
K. Y. Cheong, Takeshi Koshiba
CCS
2005
ACM
15 years 11 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...