Journal of the ACM (JACM)
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Replication is not needed: single database, computationally-private information retrieval
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding a small root of a univariate modular equation
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Finding a small root of a bivariate integer equation; factoring with high bits known
EUROCRYPT'96 Proceedings of the 15th annual 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
Password authenticated key exchange using hidden smooth subgroups
Proceedings of the 12th ACM conference on Computer and communications security
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
A New Protocol for Conditional Disclosure of Secrets and Its Applications
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Succinct NP Proofs from an Extractability Assumption
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Shared and Searchable Encrypted Data for Untrusted Servers
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Public-Key Locally-Decodable Codes
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
ISC '08 Proceedings of the 11th international conference on Information Security
Efficient Multi-authorizer Accredited Symmetrically Private Information Retrieval
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
Communication-Efficient Private Protocols for Longest Common Subsequence
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
A New Approach for Biometric Template Storage and Remote Authentication
ICB '09 Proceedings of the Third International Conference on Advances in Biometrics
Another Look at Extended Private Information Retrieval Protocols
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Communications of the ACM
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
A survey of single-database private information retrieval: techniques and applications
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Extended private information retrieval and its application in biometrics authentications
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Improving the accuracy and storage cost in biometric remote authentication schemes
Journal of Network and Computer Applications
A formal study of the privacy concerns in biometric-based remote authentication schemes
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
An authentication protocol with encrypted biometric data
AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
A linear lower bound on the communication complexity of single-server private information retrieval
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Error-tolerant searchable encryption
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Quantum private queries: security analysis
IEEE Transactions on Information Theory
Secure coprocessor-based private information retrieval without periodical preprocessing
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Reconstruction of falsified computer logs for digital forensics investigations
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Secure outsourcing of DNA searching via finite automata
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
On e-vote integrity in the case of malicious voter computers
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Two new efficient PIR-writing protocols
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Nearest neighbor search with strong location privacy
Proceedings of the VLDB Endowment
Efficient computationally private information retrieval from anonymity or trapdoor groups
ISC'10 Proceedings of the 13th international conference on Information security
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed privacy preserving data collection
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Correlation extractors and their applications
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Improved cryptanalysis of the multi-prime φ-hiding assumption
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Fully homomorphic encryption from ring-LWE and security for key dependent messages
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
Privacy-preserving outsourcing of brute-force key searches
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Automatically optimizing secure computation
Proceedings of the 18th ACM conference on Computer and communications security
Private search in the real world
Proceedings of the 27th Annual Computer Security Applications Conference
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Private itemset support counting
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
On the feasibility of consistent computations
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Multi-query computationally-private information retrieval with constant communication rate
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
PSD'06 Proceedings of the 2006 CENEX-SDC project international conference on Privacy in Statistical Databases
Revisiting the computational practicality of private information retrieval
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Secure data management in the cloud
DNIS'11 Proceedings of the 7th international conference on Databases in Networked Information Systems
Optimal security proofs for full domain hash, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Optimized private information retrieval using graphics processing unit with reduced accessibility
Proceedings of the CUBE International Information Technology Conference
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Private data warehouse queries
Proceedings of the 18th ACM symposium on Access control models and technologies
International Journal of Applied Cryptography
Data-oblivious graph algorithms for secure computation and outsourcing
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
DocCloud: A document recommender system on cloud computing with plausible deniability
Information Sciences: an International Journal
Towards practical private processing of database queries over public data
Distributed and Parallel Databases
| Hi-index | 0.08 |
We present a single-database private information retrieval (PIR) scheme with communication complexity ${\mathcal O}(k+d)$, where k ≥ log n is a security parameter that depends on the database size n and d is the bit-length of the retrieved database block. This communication complexity is better asymptotically than previous single-database PIR schemes. The scheme also gives improved performance for practical parameter settings whether the user is retrieving a single bit or very large blocks. For large blocks, our scheme achieves a constant “rate” (e.g., 0.2), even when the user-side communication is very low (e.g., two 1024-bit numbers). Our scheme and security analysis is presented using general groups with hidden smooth subgroups; the scheme can be instantiated using composite moduli, in which case the security of our scheme is based on a simple variant of the “Φ-hiding” assumption by Cachin, Micali and Stadler [2].