这篇文章是重新整理后再发的。前几天和日本大老板开视频会太尴尬了,虽然没怼我,但是还是很难受。今天还收到了论文盲审和提交的通知,真的是没有时间再摸鱼了,得加班肝论文了。之前的这篇文章整理的时候还不太懂安全多方计算,现在懂的稍微多点了,也多拉了几篇论文。论文来自于系统安全四大顶会CCS、SP、USENIX Security、NDSS以及密码两大顶会美密会(CRYPTO)和欧密会(EUROCRYPT)18至21年所有安全多方计算相关论文,总共131篇。爬论文时图方便,在dblp和官网找到论文后用One-Tab整理标签页再导出,写了一个小脚本可以把One-Tab导出标签页转换为markdown,脚本在本文最后面。最近几天好好学习一下,找找idea。
CRYPTO
CRYPTO 18
Non-malleable Secret Sharing for General Access Structures | SpringerLink
On the Local Leakage Resilience of Linear Secret Sharing Schemes | SpringerLink
Round-Optimal Secure Multiparty Computation with Honest Majority | SpringerLink
On the Exact Round Complexity of Secure Three-Party Computation | SpringerLink
Promise Zero Knowledge and Its Applications to Round Optimal MPC | SpringerLink
Round-Optimal Secure Multi-Party Computation | SpringerLink
SPD[equation]: Efficient MPC mod [equation] for Dishonest Majority | SpringerLink
Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings | SpringerLink
TinyKeys: A New Approach to Efficient Multi-Party Computation | SpringerLink
Fast Large-Scale Honest-Majority MPC for Malicious Adversaries | SpringerLink
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing | SpringerLink
Must the Communication Graph of MPC Protocols be an Expander? | SpringerLink
Two-Round Multiparty Secure Computation Minimizing Public Key Operations | SpringerLink
Limits of Practical Sublinear Secure Computation | SpringerLink
Amortized Complexity of Information-Theoretically Secure MPC Revisited | SpringerLink
Private Circuits: A Modular Approach | SpringerLink
Adaptive Garbled RAM from Laconic Oblivious Transfer | SpringerLink
On the Round Complexity of OT Extension | SpringerLink
CRYPTO 19
The Communication Complexity of Threshold Private Set Intersection | SpringerLink
Adaptively Secure MPC with Sublinear Communication Complexity | SpringerLink
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing | SpringerLink
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery | SpringerLink
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension | SpringerLink
Universally Composable Secure Computation with Corrupted Tokens | SpringerLink
Reusable Non-Interactive Secure Computation | SpringerLink
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More | SpringerLink
CRYPTO 20
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication | SpringerLink
Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability | SpringerLink
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing | SpringerLink
Guaranteed Output Delivery Comes Free in Honest Majority MPC | SpringerLink
Black-Box Transformations from Passive to Covert Security with Public Verifiability | SpringerLink
MPC with Friends and Foes | SpringerLink
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback | SpringerLink
Reverse Firewalls for Actively Secure MPCs | SpringerLink
Stacked Garbling | SpringerLink
Better Concrete Security for Half-Gates Garbling (in the Multi-instance Setting) | SpringerLink
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits | SpringerLink
Two-Sided Malicious Security for Private Intersection-Sum with Cardinality | SpringerLink
Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF | SpringerLink
Multiparty Generation of an RSA Modulus | SpringerLink
Non-malleability Against Polynomial Tampering | SpringerLink
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model | SpringerLink
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries | SpringerLink
EUROCRYPT
EUROCRYPT 18
Towards Breaking the Exponential Barrier for General Secret Sharing | SpringerLink
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing | SpringerLink
Adaptively Secure Garbling with Near Optimal Online Complexity | SpringerLink
A New Approach to Black-Box Concurrent Secure Computation | SpringerLink
Efficient Maliciously Secure Multiparty Computation for RAM | SpringerLink
Efficient Circuit-Based PSI via Cuckoo Hashing | SpringerLink
Overdrive: Making SPDZ Great Again | SpringerLink
EUROCRYPT 19
Founding Secure Computation on Blockchains | SpringerLink
Uncovering Algebraic Structures in the MPC Landscape | SpringerLink
A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model | SpringerLink
Degree 2 is Complete for the Round-Complexity of Malicious MPC | SpringerLink
Two Round Information-Theoretic MPC with Malicious Security | SpringerLink
Covert Security with Public Verifiability: Faster, Leaner, and Simpler | SpringerLink
Efficient Circuit-Based PSI with Linear Communication | SpringerLink
An Algebraic Approach to Maliciously Secure Private Set Intersection | SpringerLink
EUROCRYPT 20
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes | SpringerLink
Evolving Ramp Secret Sharing with a Small Gap | SpringerLink
Lower Bounds for Leakage-Resilient Secret Sharing | SpringerLink
Resource-Restricted Cryptography: Revisiting MPC Bounds in the Proof-of-Work Era | SpringerLink
Efficient Constructions for Almost-Everywhere Secure Computation | SpringerLink
The Price of Active Security in Cryptographic Protocols | SpringerLink
Succinct Non-interactive Secure Computation | SpringerLink
PSI from PaXoS: Fast, Malicious Private Set Intersection | SpringerLink
Two-Round Oblivious Transfer from CDH or LPN | SpringerLink
Private Aggregation from Fewer Anonymous Messages | SpringerLink
Broadcast-Optimal Two-Round MPC | SpringerLink
EUROCRYPT 21
Order-C Secure Multiparty Computation for Highly Repetitive Circuits | SpringerLink
The More the Merrier: Reducing the Cost of Large Scale MPC | SpringerLink
Multiparty Reusable Non-interactive Secure Computation from LWE | SpringerLink
Unbounded Multi-party Computation from Learning with Errors | SpringerLink
Generic Compiler for Publicly Verifiable Covert Multi-Party Computation | SpringerLink
Constant-Overhead Unconditionally Secure Multiparty Computation Over Binary Fields | SpringerLink
Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPN | SpringerLink
Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation | SpringerLink
VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE | SpringerLink
[equation]: Stacked Garbling with [equation] Computation | SpringerLink
Large Scale, Actively Secure Computation from LPN and Free-XOR Garbled Circuits | SpringerLink
Threshold Garbled Circuits and Ad Hoc Secure Computation | SpringerLink
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 | # -*- coding: UTF-8 -*- |