610 search results - page 62 / 122 » Information-theoretically secure protocols and security unde... |
ISW
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We propose a one-round 1-out-of-n computationally-private information retrieval protocol for -bit strings with low-degree polylogarithmic receivercomputation, linear send...
106
click to vote
COCOON
2010
Springer
15 years 4 months ago
2010
Springer
In identity-based public-key cryptography, an entity’s public key can be easily derived from its identity. The direct derivation of public keys in identity-based public-key crypt...
ICISC
2009
14 years 9 months ago
2009
We design a new (n, 1)-CPIR protocol BddCpir for -bit strings as a combination of a noncryptographic (BDD-based) data structure and a more basic cryptographic primitive (communicat...
100
click to vote
SASN
2003
ACM
15 years 5 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
108
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...