Pages that link to "Item:Q5716829"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716829):
Displaying 41 items.
- Private multiparty sampling and approximation of vector combinations (Q1014646) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Verifiable single-server private information retrieval from LWE with binary errors (Q2055570) (← links)
- Private information retrieval with sublinear online time (Q2055601) (← links)
- On the privacy of a code-based single-server computational PIR scheme (Q2120986) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Verifiable single-server private information retrieval (Q2218970) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- On Basing Private Information Retrieval on NP-Hardness (Q2796134) (← links)
- Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem (Q2807210) (← links)
- An \(\Omega (n^{1/3})\) lower bound for bilinear group based private information retrieval (Q3002789) (← links)
- Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption (Q3011906) (← links)
- (Q3374904) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Multi-query Computationally-Private Information Retrieval with Constant Communication Rate (Q3562891) (← links)
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols (Q3600384) (← links)
- Communication-Efficient Private Protocols for Longest Common Subsequence (Q3623051) (← links)
- Another Look at Extended Private Information Retrieval Protocols (Q3637147) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- Протокол конфиденциального получения информации (Q5152403) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Information Security and Privacy (Q5315290) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Asymptotically Tight Bounds for Composing ORAM with PIR (Q5738784) (← links)
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications (Q5756546) (← links)
- A Simpler Rate-Optimal CPIR Protocol (Q5854446) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Decoy-state quantum private query protocol with two-way communication (Q6140201) (← links)
- Private join and compute from PIR with default (Q6157534) (← links)
- Improved and formal proposal for device-independent quantum private query <sup>*</sup> (Q6190385) (← links)
- Near-optimal private information retrieval with preprocessing (Q6582182) (← links)
- Efficient pre-processing PIR without public-key cryptography (Q6637568) (← links)
- PIR with client-side preprocessing: information-theoretic constructions and lower bounds (Q6653044) (← links)
- Hintless single-server private information retrieval (Q6653046) (← links)
