1 Ocak 2019 Dergi makalesi Açık Erişim

Etemad, Mohammad; Kupcu, Alptekin

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Etemad, Mohammad</dc:creator>
  <dc:creator>Kupcu, Alptekin</dc:creator>
  <dc:date>2019-01-01</dc:date>
  <dc:description>Using regular encryption schemes to protect the privacy of the outsourced data implies that the client should sacrifice functionality for security. Searchable symmetric encryption (SSE) schemes encrypt the data in a way that the client can later search and selectively retrieve the required data. Many SSE schemes have been proposed, starting with static constructions, and then dynamic and adaptively secure constructions but usually in the honest-but-curious model.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/72143</dc:identifier>
  <dc:identifier>oai:zenodo.org:72143</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 27(4) 2606-2623</dc:source>
  <dc:title>Verifiable dynamic searchable encryption</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>