Sciweavers

2601 search results - page 303 / 521
» Secure Rewarding Schemes
Sort
View
STOC
1996
ACM
185views Algorithms» more  STOC 1996»
15 years 8 months ago
Adaptively Secure Multi-Party Computation
A fundamental problem in designing secure multi-party protocols is how to deal with adaptive adversaries i.e., adversaries that may choose the corrupted parties during the course ...
Ran Canetti, Uriel Feige, Oded Goldreich, Moni Nao...
IWCMC
2010
ACM
15 years 6 months ago
Secure wireless communication platform for EV-to-Grid research
"Vehicle to Grid" power or V2G will be a new green energy scheme that allows electricity to flow from Electric Vehicles (EVs) to power lines. The objective of this paper...
Huaqun Guo, Fan Yu, Wai-Choong Wong, Vivy Suhendra...
EUROCRYPT
2007
Springer
15 years 10 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
123
Voted
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
15 years 9 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
162
Voted
WS
2003
ACM
15 years 9 months ago
Secure data transmission in mobile ad hoc networks
The vision of nomadic computing with its ubiquitous access has stimulated much interest in the Mobile Ad Hoc Networking (MANET) technology. However, its proliferation strongly dep...
Panagiotis Papadimitratos, Zygmunt J. Haas