35 search results - page 2 / 7 » On the Efficiency and Security of Pairing-Based Protocols in... |
PODC
2009
ACM
14 years 5 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Motivated by database search problems such as partial match or nearest neighbor, we present secure multiparty computation protocols for constant-depth circuits. Specifically, for ...
AMW
2010
13 years 6 months ago
2010
We study query authentication schemes, algorithmic and cryptographic constructions that provide efficient and secure protocols for verifying the results of queries over structured...
CRYPTO
2010
Springer
13 years 6 months ago
2010
Springer
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—The focus of this paper is an information-theoretic study of retransmission protocols for reliable packet communication under a secrecy constraint. The hybrid automatic retransm...