Results 201 to 210 of about 16,514 (241)

ROSE: Robust Searchable Encryption With Forward and Backward Security

open access: yesIEEE Transactions on Information Forensics and Security, 2022
Dynamic searchable symmetric encryption (DSSE) has been widely recognized as a promising technique to delegate update and search queries over an outsourced database to an untrusted server while guaranteeing the privacy of data. Many efforts on DSSE have been devoted to obtaining a good tradeoff between security and performance. However, it appears that
Peng Xu, Willy Susilo, Qianhong Wu
exaly   +5 more sources

Security of LoRaWAN v1.1 in Backward Compatibility Scenarios

open access: yesProcedia Computer Science, 2018
Abstract We present security vulnerabilities of LoRaWAN v1.1 in backward compatibility scenarios and propose countermeasures. Novel low-power wireless communication technologies are continuously introduced into the IoT ecosystem, while the existing ones continue their evolution by adding new features and fixing known problems. Since most of IoT-based
Tahsin C M Donmez, Ethiopia Nigussie
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Geometric Range Search on Encrypted Data With Forward/Backward Security

IEEE Transactions on Dependable and Secure Computing, 2022
This paper presents two dynamic symmetric searchable encryption schemes for geometric range search. Our constructions are the first to provide forward/backward security in the context of SSE-based schemes supporting geometric range search. Besides, we define a security notion called content privacy.
Shabnam Kasra Kermanshahi   +2 more
exaly   +2 more sources

Lightweight RFID authentication with forward and backward security

ACM Transactions on Information and System Security, 2011
We propose a lightweight RFID authentication protocol that supports forward and backward security. The only cryptographic mechanism that this protocol uses is a pseudorandom number generator (PRNG) that is shared with the backend Server. Authentication is achieved by exchanging a few numbers (3 or 5) drawn from the PRNG.
Mike Burmester, Jorge MUNILLA
exaly   +2 more sources

Geometric Range Searchable Encryption with Forward and Backward Security

Lecture Notes in Computer Science, 2022
Chungen Xu, Pan Zhang, Xu Chungen
exaly   +2 more sources

Bestie: Very Practical Searchable Encryption with Forward and Backward Security

Lecture Notes in Computer Science, 2021
Dynamic searchable symmetric-key encryption (DSSE) is a promising crypto-tool that enables secure keyword searching over dynamically added or deleted ciphertexts. Currently, many works on DSSE devote their efforts to obtaining forward and backward security and practical performance.
Willy Susilo, Hai Jin
exaly   +2 more sources

Using Backward Induction Techniques in (Timed) Security Protocols Verification [PDF]

open access: yesLecture Notes in Computer Science, 2013
This paper shows a new way of automatic verification of properties of untimed and timed security protocols. To do this we use a modified version of previously introduced formal model based on a network of synchronized (timed) automata that expreses behaviour and distributed knowledge of users during protocol executions.
MIROSŁAW Kurkowski   +2 more
exaly   +3 more sources

Forward and backward secure keyword search with flexible keyword shielding

Information Sciences, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhijun Li 0011   +4 more
openaire   +1 more source

Updatable ElGamal Encryption Scheme with Forward and Backward Security for Cloud Storage

Communications in Computer and Information Science, 2022
Wang Baocang
exaly   +2 more sources

On backward-style verification for timed anonymity of security protocols

2016 IEEE 5th Global Conference on Consumer Electronics, 2016
Trace anonymity is an extension of the formulation of anonymity by Schneider and Sidiropoulos. To prove the trace anonymity of infinite-state or unbounded systems, we have introduced proof techniques in which we find a binary relation called an anonymous simulation.
Yoshinobu Kawabe, Nobuhiro Itô
exaly   +2 more sources

Home - About - Disclaimer - Privacy