Private information storage (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
EUROCRYPT'97 Proceedings of the 16th 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
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A Public Key Cryptosystem Based on the Subgroup Membership Problem
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Towards a Uniform Description of Several Group Based Cryptographic Primitives
Designs, Codes and Cryptography
A Public Key Cryptosystem Based On A Subgroup Membership Problem
Designs, Codes and Cryptography
Controlled privacy preserving keyword search
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Privacy preserving set intersection based on bilinear groups
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
Efficient and secure protocols for privacy-preserving set operations
ACM Transactions on Information and System Security (TISSEC)
Homomorphic encryptions of sums of groups
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Symmetric subgroup membership problems
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Practical cryptography in high dimensional tori
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Concrete chosen-ciphertext secure encryption from subgroup membership problems
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Pseudorandom generators based on subcovers for finite groups
Inscrypt'11 Proceedings of the 7th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem.We then apply the subgroup membership problem to private information retrieval schemes following the method by Kushilevitz and Ostrovsky. The resulting scheme has the same communication complexity as that of Kushilevitz and Ostrovsky.