scientific article; zbMATH DE number 1261806
From MaRDI portal
Publication:4231909
Cited in
(only showing first 100 items - show all)- Protecting data privacy in private information retrieval schemes
- SQL on structurally-encrypted databases
- Nearest private query based on quantum oblivious key distribution
- Simple and efficient two-server ORAM
- A novel quantum solution to secure two-party distance computation
- 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
- 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
- On the privacy of a code-based single-server computational PIR scheme
- Non-interactive batch arguments for NP from standard assumptions
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Garbled circuits with sublinear evaluator
- Single-server private information retrieval with sublinear amortized time
- Batch-OT with optimal rate
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Permuted puzzles and cryptographic hardness
- Privacy-enhanced attribute-based private information retrieval
- Security improvements of several basic quantum private query protocols with \(O(\log N)\) communication complexity
- Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions
- An efficient quantum private query protocol based on oracle and Grover iteration
- A new protocol for quantum private query against joint-measurement attack
- A general private information retrieval scheme for MDS coded databases with colluding servers
- Quantum oblivious transfer based on a quantum symmetrically private information retrieval protocol
- Quantum private comparison with a malicious third party
- General constructions for information-theoretic private information retrieval
- Building a dynamic searchable encrypted medical database for multi-client
- A survey of privacy-preserving mechanisms for heterogeneous data types
- Multi-user quantum private query
- Quantum private query with authentication
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Random-index PIR and applications
- Adaptive oblivious transfer and generalization
- A new multi-server scheme for private information retrieval
- Hypercubes and private information retrieval
- Linear batch codes
- An Efficient PIR Construction Using Trusted Hardware
- Another Look at Extended Private Information Retrieval Protocols
- Communication-efficient distributed oblivious transfer
- Cooperative private searching in clouds
- Upper bound on the communication complexity of private information retrieval
- Private information retrieval from coded databases with colluding servers
- Протокол конфиденциального получения информации
- Robust quantum private queries
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
- Private information retrieval using trusted hardware
- Privacy-preserving queries on encrypted data
- Adaptive oblivious transfer with access control from lattice assumptions
- Electronic jury voting protocols
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR
- Sublinear-communication secure multiparty computation does not require FHE
- Oblivious message retrieval
- Quantum private query based on quantum homomorphic encryption with qubit rotation
- Programmable distributed point functions
- Efficient private set intersection cardinality protocol in the reverse unbalanced setting
- Sublinear secure computation from new assumptions
- Optimal single-server 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
- Impossibilities in succinct arguments: black-box extraction and more
- OnionPIR: effective protection of sensitive metadata in online communication networks
- Private information retrieval from locally repairable databases with colluding servers
- Doubly efficient private information retrieval and fully homomorphic RAM computation from ring LWE
- Restricted adaptive oblivious transfer
- Private information retrieval with result verification for more servers
- Near-optimal private information retrieval with preprocessing
- Anonymous permutation routing
- Non-interactive anonymous router with quasi-linear router computation
- Secure function extensions to additively homomorphic cryptosystems
- Lower-bounds on public-key operations in PIR
- Lossy cryptography from code-based assumptions
- Doubly efficient cryptography: commitments, arguments and RAM MPC
- 10-party sublinear secure computation from standard assumptions
- Fully malicious authenticated PIR
- Hintless single-server private information retrieval
- Multiparty distributed point functions
- Information-theoretic single-server PIR in the shuffle model
- Single-server client preprocessing PIR with tight space-time trade-off
- Black box crypto is useless for doubly efficient PIR
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
- Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
- Quantum private information retrieval with lattice-based access authentication
- OCash: fully anonymous payments between blockchain light clients
- Bounded simultaneous messages
- On bounded storage key agreement and one-way functions
- Relaxed functional bootstrapping: a new perspective on BGV/BFV bootstrapping
- Efficient information-theoretic distributed point functions with general output groups
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Multi-server doubly efficient PIR in the classical model and beyond
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4231909)
