18至21年2+3大顶会MPC方向论文

这篇文章是重新整理后再发的。前几天和日本大老板开视频会太尴尬了,虽然没怼我,但是还是很难受。今天还收到了论文盲审和提交的通知,真的是没有时间再摸鱼了,得加班肝论文了。之前的这篇文章整理的时候还不太懂安全多方计算,现在懂的稍微多点了,也多拉了几篇论文。论文来自于系统安全四大顶会CCS、SP、USENIX Security、NDSS以及密码两大顶会美密会(CRYPTO)和欧密会(EUROCRYPT)18至21年所有安全多方计算相关论文,总共131篇。爬论文时图方便,在dblp和官网找到论文后用One-Tab整理标签页再导出,写了一个小脚本可以把One-Tab导出标签页转换为markdown,脚本在本文最后面。最近几天好好学习一下,找找idea。

CRYPTO

CRYPTO 18

CRYPTO 19

CRYPTO 20

EUROCRYPT

EUROCRYPT 18

EUROCRYPT 19

EUROCRYPT 20

EUROCRYPT 21

IEEE S&P

IEEE S&P 18

FuturesMEX: Secure, Distributed Futures Market Exchange | IEEE Conference Publication | IEEE Xplore

PIR with Compressed Queries and Amortized Query Processing | IEEE Conference Publication | IEEE Xplore

IEEE S&P 20

Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers | IEEE Conference Publication | IEEE Xplore

Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue | IEEE Conference Publication | IEEE Xplore

Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof | IEEE Conference Publication | IEEE Xplore

Towards Scalable Threshold Cryptosystems | IEEE Conference Publication | IEEE Xplore

USENIX Security

USENIX Security 19

Mobile Private Contact Discovery at Scale | USENIX

USENIX Security 20

Secure Multi-party Computation of Differentially Private Median | USENIX

Secure parallel computation on national scale volumes of data | USENIX

USENIX Security 21

Privacy and Integrity Preserving Computations with CRISP | USENIX

Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics | USENIX

GForce: GPU-Friendly Oblivious and Rapid Neural Network Inference | USENIX

ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation | USENIX

Fantastic Four: Honest-Majority Four-Party Secure Computation With Malicious Security | USENIX

Muse: Secure Inference Resilient to Malicious Clients | USENIX

ObliCheck: Efficient Verification of Oblivious Algorithms with Unobservable State | USENIX

CCS

CCS 20

Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

Fast Database Joins and PSI for Secret Shared Data | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

MP-SPDZ: A Versatile Framework for Multi-Party Computation | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

Ferret: Fast Extension for Correlated OT with Small Communication | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

More Efficient MPC from Improved Triple Generation and Authenticated Garbling | Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security

CCS 19

Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Endemic Oblivious Transfer | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

LevioSA: Lightweight Secure Arithmetic Computation | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Onion Ring ORAM: Efficient Constant Bandwidth Oblivious RAM from (Leveled) TFHE | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Securely Sampling Biased Coins with Applications to Differential Privacy | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Stormy: Statistics in Tor by Measuring Securely | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Efficient Publicly Verifiable 2PC over a Blockchain with Applications to Financially-Secure Computations | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

A High-Assurance Evaluator for Machine-Checked Secure Multiparty Computation | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Practical Fully Secure Three-Party Computation via Sublinear Distributed Zero-Knowledge Proofs | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

HoneyBadgerMPC and AsynchroMix: Practical Asynchronous MPC and its Application to Anonymous Communication | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Transparency Logs via Append-Only Authenticated Dictionaries | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Probabilistic Data Structures in Adversarial Environments | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Make Some ROOM for the Zeros: Data Sparsity in Secure Distributed Machine Learning | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

PIEs: Public Incompressible Encodings for Decentralized Storage | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

How to (not) Share a Password: Privacy Preserving Protocols for Finding Heavy Hitters with Adversarial Behavior | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Fast Actively Secure Five-Party Computation with Security Beyond Abort | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

SEEMless: Secure End-to-End Encrypted Messaging with less Trust | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

CHURP: Dynamic-Committee Proactive Secret Sharing | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Two-party Private Set Intersection with an Untrusted Third Party | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

CCS 18

Fast Secure Computation for Small Population over the Internet | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

HyCC: Compilation of Hybrid Protocols for Practical Secure Computation | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

NANOPI: Extreme-Scale Actively-Secure Multi-Party Computation | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Generalizing the SPDZ Compiler For Other Protocols | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Compressing Vector OLE | Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Others

需要注意,CCS有的论文页的title和论文不一致,会丢失论文标题中:后的内容,需要整理检查。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
# -*- coding: UTF-8 -*-
__author__ = 'WILL_V'

import re

ot = "ot.txt"
md = "demo.md"
count = 0

mdFormat = "#### [{r_title}]({r_url}) \n"


def convert():
with open(ot, 'r') as fo:
for line in fo.readlines():
with open(md, 'a+') as fm:
fm.write(format(line)+"\n")


def format(otline):
url = re.findall(r'^http.*?\| ', otline)
if len(url) == 0:
return otline
url = url[0].replace(" | ", "")
title = re.findall(r" \| .*$", otline)[0].lstrip(" | ")
f = mdFormat.replace("{r_title}", title).replace("{r_url}", url)
global count
count += 1
return f


if __name__ == '__main__':
convert()
print("已转换%d条链接" % count)
0%