Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
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
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
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Preserving Privacy by De-Identifying Face Images
IEEE Transactions on Knowledge and Data Engineering
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Journal of Cognitive Neuroscience
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
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
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
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
Secure evaluation of private linear branching programs with medical applications
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Privacy-preserving fingercode authentication
Proceedings of the 12th ACM workshop on Multimedia and security
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on 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
MM '11 Proceedings of the 19th ACM international conference on Multimedia
IH'12 Proceedings of the 14th international conference on Information Hiding
Secure and efficient approximate nearest neighbors search
Proceedings of the first ACM workshop on Information hiding and multimedia security
An efficient image homomorphic encryption scheme with small ciphertext expansion
Proceedings of the 21st ACM international conference on Multimedia
AUTOCRYPT: enabling homomorphic computation on servers to protect sensitive web content
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
Secure outsourced computation of iris matching
Journal of Computer Security
EsPRESSO: Efficient privacy-preserving evaluation of sample set similarity
Journal of Computer Security
| Hi-index | 0.00 |
Automatic recognition of human faces is becoming increasingly popular in civilian and law enforcement applications that require reliable recognition of humans. However, the rapid improvement and widespread deployment of this technology raises strong concerns regarding the violation of individuals' privacy. A typical application scenario for privacy-preserving face recognition concerns a client who privately searches for a specific face image in the face image database of a server. In this paper we present a privacy-preserving face recognition scheme that substantially improves over previouswork in terms of communication-and computation efficiency: the most recent proposal of Erkin et al. (PETS'09) requires O(log M) rounds and computationally expensive operations on homomorphically encrypted data to recognize a face in a database of M faces. Our improved scheme requires only O(1) rounds and has a substantially smaller online communication complexity (by a factor of 15 for each database entry) and less computation complexity. Our solution is based on known cryptographic building blocks combining homomorphic encryption with garbled circuits. Our implementation results show the practicality of our scheme also for large databases (e.g., for M = 1000 we need less than 13 seconds and less than 4 MByte on-line communication on two 2.4GHz PCs connected via Gigabit Ethernet).