Pages that link to "Item:Q4371676"
From MaRDI portal
The following pages link to Software protection and simulation on oblivious RAMs (Q4371676):
Displaying 50 items.
- Effective error-tolerant keyword search for secure cloud computing (Q458133) (← links)
- Dynamic proofs of retrievability via oblivious RAM (Q514467) (← links)
- Secure computation without computers (Q517015) (← links)
- A low-cost memory remapping scheme for address bus protection (Q666092) (← links)
- Searchable symmetric encryption over multiple servers (Q680933) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Perfectly secure oblivious parallel RAM (Q1631354) (← links)
- Practical attacks against the walnut digital signature scheme (Q1633439) (← links)
- SQL on structurally-encrypted databases (Q1633448) (← links)
- Parameter-hiding order revealing encryption (Q1633450) (← links)
- A survey on design and implementation of protected searchable data in the cloud (Q1686146) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663) (← links)
- Simple and efficient two-server ORAM (Q1710667) (← links)
- More is less: perfectly secure oblivious algorithms in the multi-server setting (Q1710668) (← links)
- Publicly verifiable searchable symmetric encryption based on efficient cryptographic components (Q1755999) (← links)
- Constant-round maliciously secure two-party computation in the RAM model (Q2010585) (← links)
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution (Q2056797) (← links)
- Structured encryption and dynamic leakage suppression (Q2056799) (← links)
- Two-server distributed ORAM with sublinear computation and constant rounds (Q2061970) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- A logarithmic lower bound for oblivious RAM (for all Parameters) (Q2139649) (← links)
- Oblivious RAM with \textit{worst-case} logarithmic overhead (Q2139650) (← links)
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time (Q2139652) (← links)
- Encrypted key-value stores (Q2152022) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- The function-inversion problem: barriers and opportunities (Q2175919) (← links)
- Stronger lower bounds for online ORAM (Q2175940) (← links)
- Privacy-enhanced attribute-based private information retrieval (Q2195304) (← links)
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority (Q2229285) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- Efficient cache attacks on AES, and countermeasures (Q2267358) (← links)
- Locally decodable and updatable non-malleable codes and their applications (Q2303459) (← links)
- Oblivious network RAM and leveraging parallelism to achieve obliviousness (Q2318092) (← links)
- Secure multi-party computation in large networks (Q2401120) (← links)
- Improved hidden vector encryption with short ciphertexts and tokens (Q2430414) (← links)
- Lower and upper bounds on obtaining history independence (Q2490116) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Oblivious RAM with worst-case logarithmic overhead (Q2697677) (← links)
- Forward secret encrypted RAM: lower bounds and applications (Q2697886) (← links)
- Partitioned searchable encryption (Q2697909) (← links)
- Private Database Access with HE-over-ORAM Architecture (Q2794501) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Oblivious Parallel RAM and Applications (Q2799095) (← links)
- Oblivious Parallel RAM: Improved Efficiency and Generic Constructions (Q2799096) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- Practical Techniques Building on Encryption for Protecting and Managing Data in the Cloud (Q2803632) (← links)
- Privacy-Preserving k-Nearest Neighbour Query on Outsourced Database (Q2817461) (← links)
