Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Energy Scalable Universal Hashing
IEEE Transactions on Computers
New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
Fast Software Encryption
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
Sharemind: A Framework for Fast Privacy-Preserving Computations
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Secure Multiparty Computation Goes Live
Financial Cryptography and Data Security
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
Evaluating branching programs on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Implementing Gentry's fully-homomorphic encryption scheme
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
A new combinational logic minimization technique with applications to cryptology
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Efficient lookup-table protocol in secure multiparty computation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
PICCO: a general-purpose compiler for private distributed computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
AES block cipher is an important cryptographic primitive with many applications. In this work, we describe how to efficiently implement the AES-128 block cipher in the multiparty setting where the key and the plaintext are both in a secret-shared form. In particular, we study several approaches for AES S-box substitution based on oblivious table lookup and circuit evaluation. Given this secure AES implementation, we build a universally composable database join operation for secret shared tables. The resulting protocol scales almost linearly with the database size and can join medium sized databases with 100,000 rows in few minutes, which makes many privacy-preserving data mining algorithms feasible in practice. All the practical implementations and performance measurements are done on the Sharemind secure multi-party computation platform.