Sciweavers

172 search results - page 27 / 35
» Black-Box Constructions of Protocols for Secure Computation
Sort
View
FC
2010
Springer
205views Cryptology» more  FC 2010»
13 years 11 months ago
On Robust Key Agreement Based on Public Key Authentication
—This paper discusses public-key authenticated key agreement protocols. First, we critically analyze several authenticated key agreement protocols and uncover various theoretical...
Feng Hao
SOSP
2005
ACM
14 years 4 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
13 years 12 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
ASIACRYPT
2004
Springer
14 years 1 months ago
Secret Handshakes from CA-Oblivious Encryption
Secret handshakes were recently introduced [BDS+ 03] to allow members of the same group to authenticate each other secretly, in the sense that someone who is not a group member ca...
Claude Castelluccia, Stanislaw Jarecki, Gene Tsudi...
ACSC
2008
IEEE
14 years 2 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen