Sciweavers

212 search results - page 3 / 43
» Universally Composable Commitments
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of s...
Ran Canetti, Huijia Lin, Rafael Pass
ATAL
2008
Springer
13 years 9 months ago
An Automata-Based Monitoring Technique for Commitment-Based Multi-Agent Systems
In open multi-agent systems (MASs) we cannot assume agents to be developed in a centralized fashion. Recent proposals of commitmentbased communication frameworks aim at increasing ...
Paola Spoletini, Mario Verdicchio
CRYPTO
2008
Springer
85views Cryptology» more  CRYPTO 2008»
13 years 8 months ago
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Yevgeniy Dodis, Victor Shoup, Shabsi Walfish
FC
2005
Springer
142views Cryptology» more  FC 2005»
14 years 16 days ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova
TCC
2009
Springer
160views Cryptology» more  TCC 2009»
14 years 7 months ago
Simple, Black-Box Constructions of Adaptively Secure Protocols
We present a compiler for transforming an oblivious transfer (OT) protocol secure against an adaptive semi-honest adversary into one that is secure against an adaptive malicious ad...
Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, H...