Random access machine in secure multi-party computation Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/8623j1564

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Secure multi-party computation (MPC) is a conceptual framework in cryptography. It allows distrusting parties engage in a protocol to perform a computational task while still maintain some secure properties. Most existing approaches are required to interpret functions as a boolean circuit. With the recent state-of-art circuit garbling scheme, the performance are significantly improved. However, boolean circuit still has its limitations in practical usage, especially when the input data size is enormous. In this thesis, we focus on another technique in MPC which is called random-access machines (RAM program). We first describe a zero-knowledge proof system in which a prover holds a large dataset M and can repeatedly prove NP relations about that dataset. This system achieves sublinear amortized cost. Second, we present the first practical protocols for evaluating RAM programs with security against malicious adversaries. The extra overhead of obtaining malicious security for RAM programs is minimal and does not grow with the running time of the program.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2015-06-30T16:46:15Z (GMT) No. of bitstreams: 2 license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5) HuZhangxiang2015.pdf: 1649469 bytes, checksum: 3cb2c9402828452be4d18a3fcc326ea4 (MD5)
  • description.provenance : Made available in DSpace on 2015-07-08T22:55:58Z (GMT). No. of bitstreams: 2 license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5) HuZhangxiang2015.pdf: 1649469 bytes, checksum: 3cb2c9402828452be4d18a3fcc326ea4 (MD5) Previous issue date: 2015-06-03
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2015-07-08T22:55:58Z (GMT) No. of bitstreams: 2 license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5) HuZhangxiang2015.pdf: 1649469 bytes, checksum: 3cb2c9402828452be4d18a3fcc326ea4 (MD5)
  • description.provenance : Submitted by Zhangxiang Hu (huz@onid.orst.edu) on 2015-06-29T23:49:47Z No. of bitstreams: 2 license_rdf: 1536 bytes, checksum: df76b173e7954a20718100d078b240a8 (MD5) HuZhangxiang2015.pdf: 1649469 bytes, checksum: 3cb2c9402828452be4d18a3fcc326ea4 (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items