Sciweavers

125 search results - page 7 / 25
» Realizing Secure Multiparty Computation on Incomplete Networ...
Sort
View
143
Voted
JOC
2007
84views more  JOC 2007»
15 years 2 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
127
Voted
FOCS
2010
IEEE
15 years 19 days 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
111
Voted
CCS
2009
ACM
15 years 9 months ago
Multi-party off-the-record messaging
Most cryptographic algorithms provide a means for secret and authentic communication. However, under many circumstances, the ability to repudiate messages or deny a conversation i...
Ian Goldberg, Berkant Ustaoglu, Matthew Van Gundy,...
128
Voted
BPM
2007
Springer
118views Business» more  BPM 2007»
15 years 8 months ago
Privacy Preserving Collaborative Business Process Management
The basic objective of collaborative supply chain planning (CSCP) is to fulfill the demand of the customers by integrating a network of organizations through mediums such as intern...
Sumit Chakraborty, Asim Kumar Pal
105
Voted
EUROCRYPT
2009
Springer
16 years 3 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai