Sciweavers

1490 search results - page 215 / 298
» The Logic of Authentication Protocols
Sort
View
ASIACRYPT
2001
Springer
14 years 1 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
VLDB
2007
ACM
115views Database» more  VLDB 2007»
14 years 9 months ago
NS2: Networked Searchable Store with Correctness
In an outsourced data framework, we introduce and demonstrate mechanisms for securely storing a set of data items (documents) on an un-trusted server, while allowing for subsequen...
Radu Sion, Sumeet Bajaj, Bogdan Carbunar, Stefan K...
PERCOM
2005
ACM
14 years 8 months ago
Expose or Not? A Progressive Exposure Approach for Service Discovery in Pervasive Computing Environments
In pervasive computing environments, service discovery facilitates users to access network services by automating tedious manual configurations. When network services becomes perv...
Feng Zhu, Wei Zhu, Matt W. Mutka, Lionel M. Ni
CSFW
2009
IEEE
14 years 3 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
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
14 years 3 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...