Sciweavers

621 search results - page 6 / 125
» Efficient Secure Multi-party Computation
Sort
View
HASE
2008
IEEE
14 years 4 months ago
Low Cost Secure Computation for the General Client-Server Computation Model
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
Liangliang Xiao, I-Ling Yen, Farokh B. Bastani
ICICS
2010
Springer
13 years 7 months ago
Efficient Authentication for Mobile and Pervasive Computing
With today's technology, many applications rely on the existence of small devices that can exchange information and form communication networks. In a significant portion of su...
Basel Alomair, Radha Poovendran
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
13 years 11 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers
ASIACRYPT
2008
Springer
13 years 11 months ago
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recently Cash, Kiltz, and Shoup [20] showed a variant of the Cramer-Shoup (CS) public key encryption (PKE) scheme [21] whose chosen-ciphertext (CCA) security relies on the computa...
Goichiro Hanaoka, Kaoru Kurosawa
CRYPTO
2008
Springer
165views Cryptology» more  CRYPTO 2008»
13 years 11 months ago
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
Payman Mohassel, Enav Weinreb