Sciweavers

686 search results - page 80 / 138
» Secure Two-Party Computation Is Practical
Sort
View
CCS
2010
ACM
13 years 10 months ago
Accountability: definition and relationship to verifiability
Many cryptographic tasks and protocols, such as non-repudiation, contract-signing, voting, auction, identity-based encryption, and certain forms of secure multi-party computation,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
CCS
2010
ACM
13 years 10 months ago
Recruiting new tor relays with BRAIDS
Tor, a distributed Internet anonymizing system, relies on volunteers who run dedicated relays. Other than altruism, these volunteers have no incentive to run relays, causing a lar...
Rob Jansen, Nicholas Hopper, Yongdae Kim
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
INFORMATICALT
2006
134views more  INFORMATICALT 2006»
13 years 10 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...
CLUSTER
2002
IEEE
14 years 3 months ago
User-Level Remote Data Access in Overlay Metacomputers
A practical problem faced by users of metacomputers and computational grids is: If my computation can move from one system to another, how can I ensure that my data will still be ...
Jeff Siegel, Paul Lu