A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
All-or-nothing disclosure of secrets
Proceedings on Advances in cryptology---CRYPTO '86
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
Privacy-Preserving Cooperative Scientific Computations
CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Enhancing security and privacy in biometrics-based authentication systems
IBM Systems Journal - End-to-end security
Privacy protecting data collection in media spaces
Proceedings of the 12th annual ACM international conference on Multimedia
Preserving Privacy by De-Identifying Face Images
IEEE Transactions on Knowledge and Data Engineering
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Protecting Biometric Templates With Sketch: Theory and Practice
IEEE Transactions on Information Forensics and Security - Part 2
eSketch: a privacy-preserving fuzzy commitment scheme for authentication using encrypted biometrics
Proceedings of the 12th ACM workshop on Multimedia and security
Non-invertible and revocable iris templates using key-dependent wavelet transforms
Proceedings of the first ACM workshop on Information hiding and multimedia security
| Hi-index | 0.00 |
The goal of this research is to develop provable secure computation techniques for two biometric security tasks; namely biometric data retrieval and authentication. We first present models for privacy and security that delineate the conditions under which biometric data disclosure are allowed, the conditions under which the protocol for data exchange should be provable secure, and the conditions under which the computation should be provable private. We then present a novel technique based on singular value decomposition and homomorphic encryption to achieve secure computation for biometric data retrieval. Finally we show a proof-of-concept implementation of the proposed techniques to realize a privacy preserving speaker verification system.