Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2024
Privacy-preserving double auction for resource allocation in satellite MEC
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Volume 45, Issue 3Pages 149–157https://doi.org/10.1504/ijahuc.2024.137513Mobile edge computing (MEC) can deploy applications at the edge of the network in real-time and adapt to diverse service scenarios. In recent years, resource allocation auction in MEC has received widespread attention. Most studies only focus on ...
- research-articleNovember 2023
Towards Generic MPC Compilers via Variable Instruction Set Architectures (VISAs)
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications SecurityPages 2516–2530https://doi.org/10.1145/3576915.3616664In MPC, we usually represent programs as circuits. This is a poor fit for programs that use complex control flow, as it is costly to compile control flow to circuits. This motivated prior work to emulate CPUs inside MPC. Emulated CPUs can run complex ...
- ArticleOctober 2023
- invited-talkAugust 2023
Towards Fast and Scalable Private Inference
CF '23: Proceedings of the 20th ACM International Conference on Computing FrontiersPages 322–328https://doi.org/10.1145/3587135.3592169Privacy and security have rapidly emerged as first order design constraints. Users now demand more protection over who can see their data (confidentiality) as well as how it is used (control). Here, existing cryptographic techniques for security fall ...
- research-articleOctober 2022
Two-round Multiparty Secure Computation from Minimal Assumptions
Journal of the ACM (JACM), Volume 69, Issue 5Article No.: 36, Pages 1–30https://doi.org/10.1145/3566048We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest ...
-
- research-articleJanuary 2022
Private identity agreement for private set functionalities1
Journal of Computer Security (JOCS), Volume 30, Issue 1Pages 79–107https://doi.org/10.3233/JCS-200115Private set intersection and related functionalities are among the most prominent real-world applications of secure multiparty computation. While such protocols have attracted significant attention from the research community, other functionalities are ...
- research-articleJanuary 2022
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
SIAM Journal on Computing (SICOMP), Volume 51, Issue 2Pages STOC17-333–STOC17-399https://doi.org/10.1137/17M1151602Yao's circuit garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in many ways and has innumerable applications. ...
- research-articleNovember 2021
One Hot Garbling
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityPages 574–593https://doi.org/10.1145/3460120.3484764Garbled Circuit (GC) is the main practical 2PC technique, yet despite great interest in its performance, GC notoriously resists improvement. Essentially, we only know how to evaluate GC functions gate-by-gate using encrypted truth tables; given input ...
- research-articleNovember 2020
Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC
- Jackson Abascal,
- Mohammad Hossein Faghihi Sereshgi,
- Carmit Hazay,
- Yuval Ishai,
- Muthuramakrishnan Venkitasubramaniam
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityPages 1591–1605https://doi.org/10.1145/3372297.3423366One of the most challenging aspects in secure computation is offering protection against active adversaries, who may arbitrarily alter the behavior of corrupted parties. A powerful paradigm due to Goldreich, Micali, and Wigderson (GMW), is to follow a ...
- research-articleNovember 2020
WI is Almost Enough: Contingent Payment All Over Again
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityPages 641–656https://doi.org/10.1145/3372297.3417888The problem of fair exchange consists of interchanging goods between two parties that do not trust each other. Despite known impossibility results, recent works leverage the block-chain and zero-knowledge proofs to implement zero-knowledge contingent ...
- research-articleNovember 2019
Zaphod: Efficiently Combining LSSS and Garbled Circuits in SCALE
WAHC'19: Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic CryptographyPages 33–44https://doi.org/10.1145/3338469.3358943We present modifications to the MPC system SCALE-MAMBA to enable the evaluation of garbled circuit (GC) based MPC functionalities and Linear Secret Sharing (LSSS) based MPC functionalities along side each other. This allows the user to switch between ...
- research-articleNovember 2019
Fast Actively Secure Five-Party Computation with Security Beyond Abort
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications SecurityPages 1573–1590https://doi.org/10.1145/3319535.3345657Secure Multi-party Computation (MPC) with small population and honest majority has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. In this work, we investigate a wide range of ...
- research-articleJanuary 2019
Outsourcing computation for private function evaluation
International Journal of Information and Computer Security (IJICS), Volume 11, Issue 6Pages 525–561https://doi.org/10.1504/ijics.2019.103052Outsourced secure multiparty computation (SMC) protocols allow resource-constrained devices to execute input-private computation with great efficiency. Unfortunately, existing outsourced SMC protocols require that all parties know the function being ...
- research-articleOctober 2018
Fast Secure Computation for Small Population over the Internet
CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications SecurityPages 677–694https://doi.org/10.1145/3243734.3243784Secure Multi-Party Computation (MPC) with small number of parties is an interesting area of research, primarily due to its ability to model most real-life MPC applications and the simplicity and efficiency of the resulting protocols. In this work, we ...
- research-articleMay 2018
Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications
- M. Sadegh Riazi,
- Christian Weinert,
- Oleksandr Tkachenko,
- Ebrahim M. Songhori,
- Thomas Schneider,
- Farinaz Koushanfar
ASIACCS '18: Proceedings of the 2018 on Asia Conference on Computer and Communications SecurityPages 707–721https://doi.org/10.1145/3196494.3196522We present Chameleon, a novel hybrid (mixed-protocol) framework for secure function evaluation (SFE) which enables two parties to jointly compute a function without disclosing their private inputs. Chameleon combines the best aspects of generic SFE ...
- research-articleOctober 2017
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityPages 277–294https://doi.org/10.1145/3133956.3134100While the feasibility of constant-round and actively secure MPC has been known for over two decades, the last few years have witnessed a flurry of designs and implementations that make its deployment a palpable reality. To our knowledge, however, ...
- research-articleOctober 2017
DUPLO: Unifying Cut-and-Choose for Garbled Circuits
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityPages 3–20https://doi.org/10.1145/3133956.3133991Cut-and-choose (CC) is the standard approach to making Yao's garbled circuit two-party computation (2PC) protocol secure against malicious adversaries. Traditional cut-and-choose operates at the level of entire circuits, whereas the LEGO paradigm (...
- research-articleMarch 2017Distinguished Paper
Privacy-Preserving HMM Forward Computation
CODASPY '17: Proceedings of the Seventh ACM on Conference on Data and Application Security and PrivacyPages 83–94https://doi.org/10.1145/3029806.3029816In many areas such as bioinformatics, pattern recognition, and signal processing, Hidden Markov Models (HMMs) have become an indispensable statistical tool. A fundamental building block for these applications is the Forward algorithm which computes the ...
- research-articleFebruary 2017
Secure Function Evaluation Using an FPGA Overlay Architecture
FPGA '17: Proceedings of the 2017 ACM/SIGDA International Symposium on Field-Programmable Gate ArraysPages 257–266https://doi.org/10.1145/3020078.3021746Secure Function Evaluation (SFE) has received considerable attention recently due to the massive collection and mining of personal data over the Internet, but large computational costs still render it impractical. In this paper, we leverage hardware ...
- research-articleOctober 2016
Garbling Gadgets for Boolean and Arithmetic Circuits
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityPages 565–577https://doi.org/10.1145/2976749.2978410We present simple, practical, and powerful new techniques for garbled circuits. These techniques result in significant concrete and asymptotic improvements over the state of the art, for several natural kinds of computations. For arithmetic circuits ...