Oblivious and Fair Server-Aided Two-Party Computation

@article{Herzberg2012ObliviousAF,
  title={Oblivious and Fair Server-Aided Two-Party Computation},
  author={Amir Herzberg and Haya Shulman},
  journal={2012 Seventh International Conference on Availability, Reliability and Security},
  year={2012},
  pages={75-84}
}
  • A. Herzberg, Haya Shulman
  • Published 20 August 2012
  • Computer Science, Mathematics
  • 2012 Seventh International Conference on Availability, Reliability and Security
We show efficient, practical (server-aided) securetwo-party computation protocols ensuring privacy, correctnessand fairness in the presence of malicious (Byzantine) faults. Ourrequirements from the server are modest: to ensure privacyand correctness, we only assume offline set-up prior to protocolexecution; and to also ensure fairness, we further assume atrusted-decryption service, providing decryption service usingknown public key. The fairness-ensuring protocol is optimistic, i.e., the… 
Ad-Hoc Secure Two-Party Computation on Mobile Devices using Hardware Tokens
TLDR
This work optimize and implement the secure computation protocol by Goldreich-Micali-Wigderson on mobile phones by extending the protocol by a trusted hardware token (i.e., a smartcard) to increase performance and develop and analyze a proof-of-concept implementation of generic secure two-party computation on Android smart phones making use of a microSD smartcard.
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
TLDR
Chameleon combines the best aspects of generic SFE protocols with the ones that are based upon additive secret sharing, and improves the efficiency of mining and classification of encrypted data for algorithms based upon heavy matrix multiplications.
Server-assisted fully homomorphic computation protocols
  • G. D. Crescenzo
  • Computer Science, Mathematics
    2016 IEEE Conference on Communications and Network Security (CNS)
  • 2016
TLDR
In a participant model where users are assisted by a single (cloud-based) server, it is shown how users can homomorphically compute any arbitrary arithmetic circuit, with inputs in any ring with efficient operations, over ciphertexts generated according to partially malleable encryption schemes.
PPAD: Privacy Preserving Group-Based ADvertising in Online Social Networks
TLDR
This work proposes the first Privacy Preserving Group-Based Advertising (PPAD) system that gives monetizing ability for the OSN providers and is shown to be secure in the presence of honest but curious servers that are allowed to create fake users or advertisers.
Privado: Privacy-Preserving Group-based Advertising using Multiple Independent Social Network Providers
TLDR
This work proposes Privado as a privacy-preserving group-based advertising mechanism to be integrated into secure OSNs to re-empower monetizing ability and argues about the optimum number of servers with respect to user privacy and advertising running time.
Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation
TLDR
A framework for server-aided secure two-party computation with the security model motivated by genomic applications is put forward and certified inputs are incorporated into secure computation based on garbled circuit evaluation to guarantee that a malicious user is unable to modify her inputs in order to learn unauthorized information about the other user’s data.
Oblivious and fair server-aided two-party computation

References

SHOWING 1-10 OF 62 REFERENCES
Optimistic Fair Secure Computation
We present an efficient and fair protocol for secure two-party computation in the optimistic model, where a partially trusted third party T is available, but not involved in normal protocol
Efficiency Tradeoffs for Malicious Two-Party Computation
TLDR
This work develops a weaker definition of security (k-leaked model) for malicious two-party computation that allows for disclosure of some information to a malicious party and designs more efficient variations of Yao's protocol that are secure in the proposed model.
Legally-Enforceable Fairness in Secure Two-Party Computation
TLDR
This paper shows how a legal infrastructure that respects digital signatures can be used to enforce fairness in two-party computation and has the property that if one party obtains output while the other does not, then the party not obtaining output has a digitally signed cheque from the other party.
Partial Fairness in Secure Two-Party Computation
TLDR
A definition of partial fairness within the standard real-/ideal-world paradigm is proposed and it is shown that there exist functions with super-polynomial domains and ranges for which it is impossible to achieve the definition.
Simple and fast optimistic protocols for fair electronic exchange
TLDR
Fair exchanges that are optimistic are reviewed, that is, relying on a trusted party that does not participate at all in an honest execution and yet guarantees the fairness of all executions.
Complete Fairness in Secure Two-Party Computation
TLDR
This paper shows feasibility of obtaining complete fairness when computing any function over polynomial-size domains that does not contain an “embedded XOR” and proves a lower bound showing that any completely fair protocol for such functions must have round complexity super-logarithmic in the security parameter.
Multiparty Computation for Dishonest Majority: from Passive to Active Security at Low Cost
TLDR
A new protocol to securely evaluate reactive arithmetic circuits, that offers security against an active adversary in the universally composable security framework is proposed.
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
TLDR
An efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries and combines techniques from folklore along with new techniques for efficiently proving consistency of inputs.
Revisiting the Efficiency of Malicious Two-Party Computation
TLDR
A modification to the efficiency of secure two-party computation in the presence of malicious behavior is proposed using expanders, which improves at least one measure of efficiency of all known schemes.
Fair Secure Two-Party Computation
We demonstrate a transformation of Yao's protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol prematurely.
...
...