Oblivious keyword search
From MaRDI portal
Publication:1827575
DOI10.1016/j.jco.2003.08.023zbMath1059.68050OpenAlexW2080666024MaRDI QIDQ1827575
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.023
Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Related Items (11)
Rate-limited secure function evaluation ⋮ Oblivious Keyword Search with Authorization ⋮ Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost ⋮ Solutions to the anti-piracy problem in oblivious transfer ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Universally Composable Adaptive Oblivious Transfer ⋮ Towards Robust Computation on Encrypted Data ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation ⋮ Augmented Oblivious Polynomial Evaluation Protocol and Its Applications
Cites Work
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Oblivious transfer and polynomial evaluation
- Private information retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Oblivious keyword search