Data oblivious ISA extensions for side channel-resistant and high performance computing

J Yu, L Hsiung, M El Hajj, CW Fletcher - Cryptology ePrint Archive, 2018 - eprint.iacr.org
Blocking microarchitectural (digital) side channels is one of the most pressing challenges in
hardware security today. Recently, there has been a surge of effort that attempts to block …

A probabilistic separation logic

G Barthe, J Hsu, K Liao - Proceedings of the ACM on Programming …, 2019 - dl.acm.org
Probabilistic independence is a useful concept for describing the result of random sampling—
a basic operation in all probabilistic languages—and for reasoning about groups of random …

Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation

Q Ye, B Delaware - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
Secure multiparty computation (MPC) techniques enable multiple parties to compute joint
functions over their private data without sharing that data with other parties, typically by …

Taype: A Policy-Agnostic Language for Oblivious Computation

Q Ye, B Delaware - Proceedings of the ACM on Programming …, 2023 - dl.acm.org
Secure multiparty computation (MPC) allows for joint computation over private data from
multiple entities, usually backed by powerful cryptographic techniques that protect sensitive …

[PDF][PDF] MPCDiff: Testing and Repairing MPC-Hardened Deep Learning Models

Q Pang, Y Yuan, S Wang - 2024 - ndss-symposium.org
Secure multi-party computation (MPC) has recently become prominent as a concept to
enable multiple parties to perform privacy-preserving machine learning without leaking …

PP-CSA: Practical Privacy-Preserving Software Call Stack Analysis

Z Wang, P Ma, H Wang, S Wang - Proceedings of the ACM on …, 2024 - dl.acm.org
Software call stack is a sequence of function calls that are executed during the runtime of a
software program. Software call stack analysis (CSA) is widely used in software engineering …

Oblivious algebraic data types

Q Ye, B Delaware - Proceedings of the ACM on Programming …, 2022 - dl.acm.org
Secure computation allows multiple parties to compute joint functions over private data
without leaking any sensitive data, typically using powerful cryptographic techniques. Writing …

Probabilistic analysis of binary sessions

O Inverso, H Melgratti, L Padovani, C Trubiani… - arXiv preprint arXiv …, 2020 - arxiv.org
We study a probabilistic variant of binary session types that relate to a class of Finite-State
Markov Chains. The probability annotations in session types enable the reasoning on the …

Verification of quantitative hyperproperties using trace enumeration relations

S Sahai, P Subramanyan, R Sinha - International Conference on …, 2020 - Springer
Many important cryptographic primitives offer probabilistic guarantees of security that can be
specified as quantitative hyperproperties; these are specifications that stipulate the …

Separated and shared effects in higher-order languages

PHA de Amorim, J Hsu - arXiv preprint arXiv:2303.01616, 2023 - arxiv.org
Effectful programs interact in ways that go beyond simple input-output, making
compositional reasoning challenging. Existing work has shown that when such programs …