scientific article; zbMATH DE number 1261806
From MaRDI portal
Publication:4231909
zbMath0938.68625MaRDI QIDQ4231909
Oded Goldreich, Eyal Kushilevitz, Madhu Sudan, Benny Chor
Publication date: 26 April 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (74)
On the privacy of a code-based single-server computational PIR scheme ⋮ Selling multiple secrets to a single buyer ⋮ SQL on structurally-encrypted databases ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time ⋮ Linear Batch Codes ⋮ Electronic jury voting protocols ⋮ Garbled circuits with sublinear evaluator ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Batch-OT with optimal rate ⋮ Upper bound on the communication complexity of private information retrieval ⋮ Building a dynamic searchable encrypted medical database for multi-client ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles ⋮ Compressible FHE with applications to PIR ⋮ Permuted puzzles and cryptographic hardness ⋮ A survey of privacy-preserving mechanisms for heterogeneous data types ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Oblivious message retrieval ⋮ Quantum private query based on quantum homomorphic encryption with qubit rotation ⋮ Multi-user quantum private query ⋮ Programmable distributed point functions ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Sublinear secure computation from new assumptions ⋮ Enhancing user privacy in SARG04-based private database query protocols ⋮ Optimal single-server private information retrieval ⋮ Privacy-enhanced attribute-based private information retrieval ⋮ Private join and compute from PIR with default ⋮ Exipnos: an efficient verifiable dynamic symmetric searchable encryption scheme with forward and backward privacy ⋮ A survey on single server private information retrieval in a coding theory perspective ⋮ Optimal possibly nonlinear 3-PIR codes of small size ⋮ A proposal for device independent probabilistic quantum oblivious transfer ⋮ Nearest private query based on quantum oblivious key distribution ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Quantum private query with authentication ⋮ Private Information Retrieval from Coded Databases with Colluding Servers ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Random-index PIR and applications ⋮ Communication-efficient distributed oblivious transfer ⋮ A new multi-server scheme for private information retrieval ⋮ Simple and efficient two-server ORAM ⋮ Cooperative private searching in clouds ⋮ Restricted adaptive oblivious transfer ⋮ An Efficient PIR Construction Using Trusted Hardware ⋮ Hypercubes and Private Information Retrieval ⋮ Протокол конфиденциального получения информации ⋮ Robust quantum private queries ⋮ A novel quantum solution to secure two-party distance computation ⋮ General constructions for information-theoretic private information retrieval ⋮ Optimal configurations for peer-to-peer user-private information retrieval ⋮ Private database queries using one quantum state ⋮ Privacy-preserving verifiable delegation of polynomial and matrix functions ⋮ Capacity-achieving private information retrieval scheme with a smaller sub-packetization ⋮ A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval ⋮ Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Multi-server verifiable delegation of computations: unconditional security and practical efficiency ⋮ Multi-value private information retrieval with colluding databases via trace functions ⋮ Verifiable single-server private information retrieval from LWE with binary errors ⋮ Private information retrieval with sublinear online time ⋮ Stacked garbling for disjunctive zero-knowledge proofs ⋮ Breaking the circuit size barrier for secure computation under quasi-polynomial LPN ⋮ Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions ⋮ Another Look at Extended Private Information Retrieval Protocols ⋮ An efficient quantum private query protocol based on oracle and Grover iteration ⋮ A new protocol for quantum private query against joint-measurement attack ⋮ Protecting data privacy in private information retrieval schemes ⋮ A general private information retrieval scheme for MDS coded databases with colluding servers ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Private Information Retrieval Using Trusted Hardware ⋮ Privacy-Preserving Queries on Encrypted Data ⋮ Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol ⋮ Quantum private comparison with a malicious third party
This page was built for publication:
