Sciweavers

5476 search results - page 28 / 1096
» Resettably Secure Computation
Sort
View
CRYPTO
2011
Springer
207views Cryptology» more  CRYPTO 2011»
14 years 3 months ago
Secure Computation on the Web: Computing without Simultaneous Interaction
Secure computation enables mutually suspicious parties to compute a joint function of their private inputs while providing strong security guarantees. Amongst other things, even i...
Shai Halevi, Yehuda Lindell, Benny Pinkas
158
Voted
FOCS
2010
IEEE
15 years 1 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai
132
Voted
JOC
2000
95views more  JOC 2000»
15 years 3 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
158
Voted
CCS
2010
ACM
15 years 10 months ago
Secure provenance: the essential of bread and butter of data forensics in cloud computing
Secure provenance that records ownership and process history of data objects is vital to the success of data forensics in cloud computing, yet it is still a challenging issue toda...
Rongxing Lu, Xiaodong Lin, Xiaohui Liang, Xuemin (...