CRYPTO '89 Proceedings on Advances in cryptology
Efficient point location in a convex spatial cell-complex
SIAM Journal on Computing
Point location among hyperplanes and unidirectional ray-shooting
Computational Geometry: Theory and Applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Client/Server Tradeoffs for Online Elections
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Privacy-preserving Bayesian network structure computation on distributed heterogeneous data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
A Scheme for Testing Privacy State in Pervasive Sensor Networks
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
Two-Party Private Vector Dominance: The All-Or-Nothing Deal
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
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 threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient proofs that a committed number lies in an interval
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Efficient binary conversion for paillier encrypted values
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
IEEE Transactions on Signal Processing - Part II
Protection and retrieval of encrypted multimedia content: when cryptography meets signal processing
EURASIP Journal on Information Security
Efficient pointwise and blockwise encrypted operations
Proceedings of the 10th ACM workshop on Multimedia and security
Composite signal representation for fast and storage-efficient processing of encrypted signals
IEEE Transactions on Information Forensics and Security
A secure protocol for point-segment position problem
WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
Private computation of spatial and temporal power consumption with smart meters
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Privacy-preserving content-based recommender system
Proceedings of the on Multimedia and security
IH'12 Proceedings of the 14th international conference on Information Hiding
An efficient image homomorphic encryption scheme with small ciphertext expansion
Proceedings of the 21st ACM international conference on Multimedia
| Hi-index | 0.00 |
Signal processing in the encrypted domain combines typical signal processing operations and cryptographic primitives to ensure security in applications involving mutually distrusting participants. Several such applications reduce to a multidimensional point inclusion problem where two participants decide whether a point known to the first lies inside a region specified by the second. In a secure solution, neither party gains knowledge about the other's input. For instance, in biometric authentication the client can prove his identity without disclosing his biometric. In this paper, we present a new primitive for securely solving the multidimensional point inclusion problem. Using this primitive, we first propose an efficient and provably secure protocol that solves the problem for an N-dimensional convex region bounded with hyperplanes. We subsequently extend the protocol to inclusion in multiple hyperellipsoidal regions. Considering possible reduction strategies such as input packing, we analyze the complexity of both protocols.