Founding cryptography on tamper-proof hardware tokens

V Goyal, Y Ishai, A Sahai, R Venkatesan… - Theory of Cryptography …, 2010 - Springer
A number of works have investigated using tamper-proof hardware tokens as tools to
achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered …

Memory leakage-resilient encryption based on physically unclonable functions

F Armknecht, R Maes, AR Sadeghi, B Sunar… - … Foundations and Practice, 2010 - Springer
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

Asterisk: Super-fast MPC with a Friend

B Karmakar, N Koti, A Patra… - … IEEE Symposium on …, 2024 - ieeexplore.ieee.org
Secure multiparty computation (MPC) enables privacy-preserving collaborative computation
over sensitive data held by multiple mutually distrusting parties. Unfortunately, in the most …

[PDF][PDF] Proof-Carrying Data and Hearsay Arguments from Signature Cards.

A Chiesa, E Tromer - ICS, 2010 - people.eecs.berkeley.edu
Design of secure systems can often be expressed as ensuring that some property is
maintained at every step of a distributed computation among mutually-untrusting parties …

Universally composable secure computation with (malicious) physically uncloneable functions

R Ostrovsky, A Scafuro, I Visconti, A Wadia - Advances in Cryptology …, 2013 - Springer
Abstract Physically Uncloneable Functions (PUFs)[28] are noisy physical sources of
randomness. As such, they are naturally appealing for cryptographic applications, and have …

Leakage-resilient zero knowledge

S Garg, A Jain, A Sahai - Advances in Cryptology–CRYPTO 2011: 31st …, 2011 - Springer
In this paper, we initiate a study of zero knowledge proof systems in the presence of side-
channel attacks. Specifically, we consider a setting where a cheating verifier is allowed to …

Interactive locking, zero-knowledge PCPs, and unconditional cryptography

V Goyal, Y Ishai, M Mahmoody, A Sahai - … Barbara, CA, USA, August 15-19 …, 2010 - Springer
Motivated by the question of basing cryptographic protocols on stateless tamper-proof
hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs …

Concurrently secure computation in constant rounds

S Garg, V Goyal, A Jain, A Sahai - … on the Theory and Applications of …, 2012 - Springer
We study the problem of constructing concurrently secure computation protocols in the plain
model, where no trust is required in any party or setup. While the well established UC …

Embedded SFE: Offloading server and network using hardware tokens

K Järvinen, V Kolesnikov, AR Sadeghi… - … Cryptography and Data …, 2010 - Springer
Abstract We consider Secure Function Evaluation (SFE) in the client-server setting where
the server issues a secure token to the client. The token is not trusted by the client and is not …

Unconditionally secure and universally composable commitments from physical assumptions

I Damgård, A Scafuro - Advances in Cryptology-ASIACRYPT 2013: 19th …, 2013 - Springer
We present a constant-round unconditional black-box compiler that transforms any ideal (ie,
statistically-hiding and statistically-binding) straight-line extractable commitment scheme …