Pages that link to "Item:Q5591930"
From MaRDI portal
The following pages link to Space/time trade-offs in hash coding with allowable errors (Q5591930):
Displaying 14 items.
- Approximate sorting and its applications in I/O model (Q6122589) (← links)
- Private join and compute from PIR with default (Q6157534) (← links)
- Faster Privacy-Preserving Location Proximity Schemes (Q6162312) (← links)
- An Almost Non-interactive Order Preserving Encryption Scheme (Q6163654) (← links)
- OnionPIR: Effective Protection of Sensitive Metadata in Online Communication Networks (Q6487221) (← links)
- Accountable Storage (Q6487222) (← links)
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols (Q6488032) (← links)
- Key-aggregate searchable encryption supporting conjunctive queries for flexible data sharing in the cloud (Q6495582) (← links)
- Unsatisfiability proofs for distributed clause-sharing SAT solvers (Q6535367) (← links)
- Efficient result-hiding searchable encryption with forward and backward privacy (Q6547902) (← links)
- A lightweight access control scheme supporting policy hidden based on path bloom filter (Q6573680) (← links)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity (Q6595687) (← links)
- Private set operations from multi-query reverse private membership test (Q6635832) (← links)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)