Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
On the multiplicative complexity of Boolean functions over the basis ∧,⊕,1
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Priced Oblivious Transfer: How to Sell Digital Goods
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Private Selective Payment Protocols
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Proceedings of the thirty-seventh 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
Privacy Preserving Nearest Neighbor Search
ICDMW '06 Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops
Privacy-preserving remote diagnostics
Proceedings of the 14th ACM conference on Computer and communications security
Homomorphic encryption and secure comparison
International Journal of Applied Cryptography
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
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
Efficient Two-Party Secure Computation on Committed Inputs
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
Efficient Privacy-Preserving k-Nearest Neighbor Search
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
LEGO for Two-Party Secure Computation
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Practical Secure Evaluation of Semi-private Functions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Secure Hamming Distance Based Computation and Its Applications
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Privacy-Preserving Face Recognition
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical and secure solutions for integer comparison
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Efficient and secure comparison for on-line auctions
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
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
Secure evaluation of private linear branching programs with medical applications
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Conditional encrypted mapping and comparing encrypted numbers
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Efficient privacy-preserving face recognition
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
Processing encrypted floating point signals
Proceedings of the thirteenth ACM multimedia workshop on Multimedia and security
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Efficient secure computation with garbled circuits
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
On the security of the "Free-XOR" technique
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
Conversion of real-numbered privacy-preserving problems into the integer domain
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Garbling XOR gates "for free" in the standard model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Secure and verifiable outsourcing of sequence comparisons
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Faster secure two-party computation with less memory
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
More efficient oblivious transfer and extensions for faster secure computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. We describe efficient GC constructions for addition, subtraction, multiplication, and comparison functions. Our circuits for subtraction and comparison are approximately two times smaller (in terms of garbled tables) than previous constructions. This implies corresponding computation and communication improvements in SFE of functions using our efficient building blocks. The techniques rely on recently proposed "free XOR" GC technique. Further, we present concrete and detailed improved GC protocols for the problem of secure integer comparison, and related problems of auctions, minimum selection, and minimal distance. Performance improvement comes both from building on our efficient basic blocks and several problem-specific GC optimizations. We provide precise cost evaluation of our constructions, which serves as a baseline for future protocols.