Software protection and simulation on oblivious RAMs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Perfectly secure oblivious parallel RAM
- Practical attacks against the walnut digital signature scheme
- SQL on structurally-encrypted databases
- Parameter-hiding order revealing encryption
- A survey on design and implementation of protected searchable data in the cloud
- On compiling Boolean circuits optimized for secure multi-party computation
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- Simple and efficient two-server ORAM
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- Publicly verifiable searchable symmetric encryption based on efficient cryptographic components
- Constant-round maliciously secure two-party computation in the RAM model
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Structured encryption and dynamic leakage suppression
- Two-server distributed ORAM with sublinear computation and constant rounds
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model
- OptORAMa: optimal oblivious RAM
- Large message homomorphic secret sharing from DCR and applications
- A logarithmic lower bound for oblivious RAM (for all Parameters)
- Oblivious RAM with \textit{worst-case} logarithmic overhead
- Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
- Encrypted key-value stores
- Single-server private information retrieval with sublinear amortized time
- Adaptively secure computation for RAM programs
- The function-inversion problem: barriers and opportunities
- Stronger lower bounds for online ORAM
- Privacy-enhanced attribute-based private information retrieval
- Improved building blocks for secure multi-party computation based on secret sharing with honest majority
- Obfuscation for cryptographic purposes
- Efficient cache attacks on AES, and countermeasures
- Locally decodable and updatable non-malleable codes and their applications
- Oblivious network RAM and leveraging parallelism to achieve obliviousness
- Secure multi-party computation in large networks
- Improved hidden vector encryption with short ciphertexts and tokens
- Lower and upper bounds on obtaining history independence
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Oblivious RAM with worst-case logarithmic overhead
- Forward secret encrypted RAM: lower bounds and applications
- Partitioned searchable encryption
- Private database access with HE-over-ORAM architecture
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Oblivious parallel RAM and applications
- Oblivious parallel RAM: improved efficiency and generic constructions
- Information-Theoretic Local Non-malleable Codes and Their Applications
- Practical techniques building on encryption for protecting and managing data in the cloud
- Privacy-preserving k-nearest neighbour query on outsourced database
- \textbf{TWORAM:} efficient oblivious RAM in two rounds with applications to searchable encryption
- Oblivious RAMs without cryptogarphic assumptions
- Data-oblivious graph algorithms in outsourced external memory
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- Balloon hashing: a memory-hard function providing provable protection against sequential attacks
- Low-leakage secure search for Boolean expressions
- Privacy-preserving access of outsourced data via oblivious RAM simulation
- Secure multiparty RAM computation in constant rounds
- Constant-round maliciously secure two-party computation in the RAM model
- Adaptive succinct garbled RAM or: how to delegate your database
- A Secure Priority Queue; Or: On Secure Datastructures from Multiparty Computation
- Founding Cryptography on Tamper-Proof Hardware Tokens
- How to Compute in the Presence of Leakage
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
- Secure Multi-party Shuffling
- An Efficient PIR Construction Using Trusted Hardware
- One-Time Programs
- Effective error-tolerant keyword search for secure cloud computing
- CacheShuffle: a family of oblivious shuffles
- Pseudorandom functions: three decades later
- Dynamic proofs of retrievability via oblivious RAM
- Secure computation without computers
- Boolean searchable symmetric encryption with worst-case sub-linear complexity
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Asymptotically tight bounds for composing ORAM with PIR
- Sublinear zero-knowledge arguments for RAM programs
- On the (in)security of hash-based oblivious RAM and a new balancing scheme
- Privacy-preserving group data access via stateless oblivious RAM simulation
- Private information retrieval using trusted hardware
- scientific article; zbMATH DE number 7650132 (Why is no real title available?)
- Is there an oblivious RAM lower bound for online reads?
- Is there an oblivious RAM lower bound for online reads?
- Locality-preserving oblivious RAM
- PrORAM
- The complexity of secure RAMs
- A theory of composition for differential obliviousness
- M-ORAM Revisited: Security and Construction Updates
- Klee's measure problem made oblivious
- Snapshot-oblivious RAMs: sub-logarithmic efficiency for short transcripts
- 3-party distributed ORAM from oblivious set membership
- Collusion-resistant functional encryption for RAMs
- Efficient searchable symmetric encryption for join queries
- Weighted oblivious RAM, with applications to searchable symmetric encryption
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead
- Lower bound framework for differentially private and oblivious data structures
- Succinct arguments for RAM programs via projection codes
- Efficient Boolean search over encrypted data with reduced leakage
- Linear-time 2-party secure merge from additively homomorphic encryption
- Random-index oblivious RAM
- One-time programs from commodity hardware
- \textsf{TreePIR}: sublinear-time and polylog-bandwidth private information retrieval from DDH
- \textsf{MacORAMa}: optimal oblivious RAM with integrity
- Tri-state circuits. A circuit model that captures RAM
This page was built for publication: Software protection and simulation on oblivious RAMs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371676)
