The Feasibility of Outsourced Database Search in the Plain Model

No abstract is available for this paper.

• Publication year

  2016

• Venue

  International Conference on Security and Cryptography for Networks

• Publication date

  2016-08-31

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-319-44618-9_17
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Exact Round Complexity of Secure Computation

  2016cited by this paper
• Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations

  2016cited by this paper
• Round-Optimal Black-Box Two-Party Computation

  2015cited by this paper
• Leakage-Abuse Attacks Against Searchable Encryption

  2015cited by this paper
• Pattern Matching Encryption

  2014cited by this paper
• Multi-Client Non-interactive Verifiable Computation

  2013cited by this paper
• Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction

  2013cited by this paper
• Outsourced pattern matching

  2013cited by this paper
• Parallel and Dynamic Searchable Symmetric Encryption

  2013cited by this paper
• Outsourced symmetric private information retrieval

  2013cited by this paper
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cited by this paper
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

  2012cited by this paper
• Salus: a system for server-aided secure function evaluation

  2012cited by this paper
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

  2012cited by this paper
• Secure Two-Party Computation with Low Communication

  2012cited by this paper
• Dynamic searchable symmetric encryption

  2012cited by this paper
• Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs

  2011cited by this paper
• Optimal Verification of Operations on Dynamic Sets

  2011cited by this paper
• Practical Adaptive Oblivious Transfer from Simple Assumptions

  2011cited by this paper
• Efficient and Secure Delegation of Linear Algebra

  2011cited by this paper
• Secure Computation on the Web: Computing without Simultaneous Interaction

  2011cited by this paper
• Verifiable Delegation of Computation over Large Datasets

  2011cited by this paper
• Outsourcing Multi-Party Computation

  2011cited by this paper
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

  2010cited by this paper
• From Secrecy to Soundness: Efficient Verification via Secure Computation

  2010cited by this paper
• Structured Encryption and Controlled Disclosure

  2010cited by this paper
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

  2010cited by this paper
• Searchable symmetric encryption: Improved definitions and efficient constructions

  2006cited by this paper
• Keyword Search and Oblivious Pseudorandom Functions

  2005cited by this paper
• Round-Optimal Secure Two-Party Computation

  2004cited by this paper
• Secure Indexes

  2003cited by this paper
• Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case

  2002cited by this paper
• Security and Composition of Multiparty Cryptographic Protocols

  2000cited by this paper
• Oblivious Transfer with Adaptive Queries

  1999cited by this paper
• Number-theoretic constructions of efficient pseudo-random functions

  1997cited by this paper
• How to generate and exchange secrets

  1986cited by this paper
• A randomized protocol for signing contracts

  1985cited by this paper
• Linear Pattern Matching Algorithms

  1973cited by this paper

• Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board

  2024cites this paper
• Cryptographic Pseudorandom Generators Can Make Cryptosystems Problematic

  2021cites this paper
• Semi-Honest Secure Multiparty Computation Can Be Insecure by Using Secure Pseudorandom Generators

  2018cites this paper
• PMDP: A Framework for Preserving Multiparty Data Privacy in Cloud Computing

  2017cites this paper
• Semi-Honest Secure Multiparty Computation Can Be Insecure with Use of Even Almost Uniformly Random Number Generators

  2016influential citation
• Outsourced pattern matching

  2013cites this paper