Sciweavers

250 search results - page 7 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
14 years 2 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
IJISEC
2006
108views more  IJISEC 2006»
13 years 7 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
PKC
2004
Springer
160views Cryptology» more  PKC 2004»
14 years 1 months ago
Constant Round Authenticated Group Key Agreement via Distributed Computation
Abstract. A group key agreement protocol allows a set of users, communicating over a public network, to agree on a private session key. Most of the schemes proposed so far require ...
Emmanuel Bresson, Dario Catalano
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
INFOCOM
2008
IEEE
14 years 2 months ago
ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications
Rongxing Lu, Xiaodong Lin, Haojin Zhu, Pin-Han Ho,...