37 search results - page 4 / 8 » Efficient Secure Auction Protocols Based on the Boneh-Goh-Ni... |
IACR
2011
12 years 7 months ago
2011
— Both broadcast encryption (BE) protocols and multicast key distribution (MKD) protocols try to solve the same problem of private group communication. For the first time, we dis...
EUROCRYPT
2004
Springer
13 years 11 months ago
2004
Springer
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
PKC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Yao’s classical millionaires’ problem is about securely determining whether x > y, given two input values x, y, which are held as private inputs by two parties, re...
ACMSE
2004
ACM
14 years 28 days ago
2004
ACM
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
SCN
2008
Springer
13 years 7 months ago
2008
Springer
Consider an electronic election scheme implemented using a mix-net; a large number of voters submit their votes and then a smaller number of servers compute the result. The mix-net...