Sciweavers

610 search results - page 45 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 13 days ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
15 years 3 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 6 months ago
Distributed Privacy-Preserving Policy Reconciliation
— Organizations use security policies to regulate how they share and exchange information, e.g., under what conditions data can be exchanged, what protocols are to be used, who i...
Ulrike Meyer, Susanne Wetzel, Sotiris Ioannidis
ECWEB
2003
Springer
114views ECommerce» more  ECWEB 2003»
15 years 5 months ago
Enhancing E-commerce Security Using GSM Authentication
Abstract. Today, e-commerce transactions are typically protected using SSL/TLS. However, there are risks in such use of SSL/TLS, notably threats arising from the fact that informat...
Vorapranee Khu-smith, Chris J. Mitchell
INFOCOM
2010
IEEE
14 years 10 months ago
Castor: Scalable Secure Routing for Ad Hoc Networks
—Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have b...
Wojciech Galuba, Panos Papadimitratos, Marcin Potu...