Embedded SFE: offloading server and network using hardware tokens

Authors:
Kimmo Järvinen;Vladimir Kolesnikov;Ahmad-Reza Sadeghi;Thomas Schneider
Affiliations:
Dep. of Information and Comp. Science, Aalto University, Finland;Alcatel-Lucent Bell Laboratories, Murray Hill, NJ;Horst Görtz Institute for IT-Security, Ruhr-University Bochum, Germany;Horst Görtz Institute for IT-Security, Ruhr-University Bochum, Germany
Venue:
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Year:
2010

Citing 18
Cited 6

Efficient oblivious transfer protocols

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Fairplay—a secure two-party computation system

SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Universally Composable Multi-party Computation Using Tamper-Proof Hardware

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improved Garbled Circuit: Free XOR Gates and Applications

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents

Financial Cryptography and Data Security
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries

SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Constructions of truly practical secure protocols using standardsmartcards

Proceedings of the 15th ACM conference on Computer and communications security
Universally Composable Multiparty Computation with Partially Isolated Parties

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology

Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Secure Two-Party Computation Is Practical

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient two party and multi party computation against covert adversaries

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
David and Goliath commitments: UC computation for asymmetric parties using tamper-proof hardware

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
New constructions for UC secure computation using tamper-proof hardware

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
A very compact s-box for AES

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
TrustedPals: secure multiparty computation implemented with smart cards

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

Token-based cloud computing: secure outsourcing of data and arbitrary computations with lower latency

TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Garbled circuits for leakage-resilience: hardware implementation and evaluation of one-time programs

CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Secure set intersection with untrusted hardware tokens

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Twin clouds: secure cloud computing with low latency

CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Faster secure two-party computation with less memory

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design

Journal of Computer Security

Quantified Score

Hi-index	0.00

Visualization

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 a trusted third party. We show how to take advantage of the token to drastically reduce the communication complexity of SFE and computation load of the server. Our main contribution is the detailed consideration of design decisions, optimizations, and trade-offs, associated with the setting and its strict hardware requirements for practical deployment. In particular, we model the token as a computationally weak device with small constant-size memory and limit communication between client and server. We consider semi-honest, covert, and malicious adversaries. We show the feasibility of our protocols based on a FPGA implementation.