Sciweavers

608 search results - page 56 / 122
» Interactive Oracle Proofs
Sort
View
JOC
2006
69views more  JOC 2006»
13 years 10 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
EUROCRYPT
2007
Springer
14 years 1 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 23 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
IEEESCC
2006
IEEE
14 years 4 months ago
Secure and Provable Service Support for Human-Intensive Real-Estate Processes
This paper introduces SOAR, a service-oriented architecture for the real-estate industry that embeds trust and security, allows for formal correctness proofs of service interactio...
Emerson Ribeiro de Mello, Savas Parastatidis, Phil...
SPAA
2009
ACM
14 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch