Difference between revisions of "Riazi2017toward"
From ACES
(Import from BibTeX) |
m (Default pdf) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 5: | Line 5: | ||
|abstract=<p><span style="color: rgba(0, 0, 0, 0.701961); font-family: \"Source Sans Pro\", Helvetica, Arial, sans-serif, \"Hiragino Kaku Gothic Pro\", Meiryo, \"Hiragino Sans GB W3\", \"Noto Naskh Arabic\", \"Droid Arabic Naskh\", \"Geeza Pro\", \"Simplified Arabic\", \"Noto Sans Thai\", Thonburi, Dokchampa, \"Droid Sans Thai\", \"Droid Sans Fallback\", -apple-system, \".SFNSDisplay-Regular\", \"Heiti SC\", \"Microsoft Yahei\", \"Segoe UI\"; font-size: 15px;">The Stable Matching (SM) algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP) and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao\’s garbled circuit protocol and Oblivious RAM (ORAM). Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.</span></p> | |abstract=<p><span style="color: rgba(0, 0, 0, 0.701961); font-family: \"Source Sans Pro\", Helvetica, Arial, sans-serif, \"Hiragino Kaku Gothic Pro\", Meiryo, \"Hiragino Sans GB W3\", \"Noto Naskh Arabic\", \"Droid Arabic Naskh\", \"Geeza Pro\", \"Simplified Arabic\", \"Noto Sans Thai\", Thonburi, Dokchampa, \"Droid Sans Thai\", \"Droid Sans Fallback\", -apple-system, \".SFNSDisplay-Regular\", \"Heiti SC\", \"Microsoft Yahei\", \"Segoe UI\"; font-size: 15px;">The Stable Matching (SM) algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP) and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao\’s garbled circuit protocol and Oblivious RAM (ORAM). Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.</span></p> | ||
|chapter=62 | |chapter=62 | ||
|month=1 | |||
|year=2017 | |||
|volume=2017 | |volume=2017 | ||
|journal=Proceedings on Privacy Enhancing Technologies | |journal=Proceedings on Privacy Enhancing Technologies | ||
|title=Toward Practical Secure Stable Matching | |title=Toward Practical Secure Stable Matching | ||
|entry=article | |entry=article | ||
| | |pdf=Riazi2017toward.pdf | ||
}} | }} | ||
Latest revision as of 17:38, 9 November 2021
| Riazi2017toward | |
|---|---|
| entry | article |
| address | |
| annote | |
| author | M. Sadegh Riazi and Songhori, Ebrahim M. and Ahmad-Reza Sadeghi and Thomas Schneider and Farinaz Koushanfar |
| booktitle | |
| chapter | 62 |
| edition | |
| editor | |
| howpublished | |
| institution | |
| journal | Proceedings on Privacy Enhancing Technologies |
| month | 1 |
| note | |
| number | |
| organization | |
| pages | |
| publisher | |
| school | |
| series | |
| title | Toward Practical Secure Stable Matching |
| type | |
| volume | 2017 |
| year | 2017 |
| doi | |
| issn | |
| isbn | |
| url | https://www.degruyter.com/downloadpdf/j/popets.2017.2017.issue-1/popets-2017-0005/popets-2017-0005.pdf |
| Riazi2017toward.pdf | |
Email:
farinaz@ucsd.edu
farinaz@ucsd.edu
Address:
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Electrical & Computer Engineering
University of California, San Diego
9500 Gilman Drive, MC 0407
Jacobs Hall, Room 6401
La Jolla, CA 92093-0407
Lab Location: EBU1-2514
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093
University of California San Diego
9500 Gilman Dr, La Jolla, CA 92093