Sciweavers

5476 search results - page 7 / 1096
» Resettably Secure Computation
Sort
View
JCS
2010
112views more  JCS 2010»
15 years 8 days ago
Inductive trace properties for computational security
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
TCC
2012
Springer
245views Cryptology» more  TCC 2012»
13 years 9 months ago
Secure Two-Party Computation with Low Communication
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the ...
Ivan Damgård, Sebastian Faust, Carmit Hazay
135
Voted
SIAMCOMP
2011
14 years 8 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
120
Voted
DPD
2000
71views more  DPD 2000»
15 years 1 months ago
A Secure Agent-based Framework for Internet Trading in Mobile Computing Environments
Most of the current Internet trading frameworks, in particular their negotiation and payment phases, are intended for customers frequently connected to the Internet during an entir...
Xun Yi, Chee Kheong Siew, Xiao Feng Wang, Eiji Oka...
SOCIALCOM
2010
14 years 8 months ago
A Multi-factor Approach to Securing Software on Client Computing Platforms
Protecting the integrity of software platforms, especially in unmanaged consumer computing systems is a difficult problem. Attackers may attempt to execute buffer overflow attacks ...
Raghunathan Srinivasan, Vivek Iyer, Amit Kanitkar,...