Titlebook: Information Security Practice and Experience; 14th International C Chunhua Su,Hiroaki Kikuchi Conference proceedings 2018 Springer Nature S

Integrate

An Almost Non-interactive Order Preserving Encryption Schemerform the order comparison or the efficient range query over encrypted data. Recently, plenty of work has been proposed on the construction of OPE scheme. Nevertheless, many existing OPE schemes require multiple rounds . of interaction. As a result, real-time online, network delay and communication

削减

Psychogenic

Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuitslter (OT-LF) and hash proof system (HPS), from which, combining garbled circuits (GC), we present an LR-CCA secure generic construction for single-key and single-ciphertext functional encryption (FE) via hash proof system (HPS) and one-time lossy filter (OT-LF). We bypass known obstacles in realizin

悲痛

Constrained (Verifiable) Pseudorandom Function from Functional Encryptionlusions. We further augment our . construction with the . feature under the same assumption. Earlier such constructions either work for very restricted settings or rely on highly powerful yet little-understood cryptographic objects such as multilinear maps or indistinguishability obfuscation (.). Al

synovium

Efficient Trapdoor Generation from Multiple Hashing in Searchable Symmetric EncryptionKamara formalized structured encryption which is a generalization of SSE, and its concrete schemes were proposed. An efficient SSE scheme (hereafter, Chase-Kamara scheme) which has a very simple encrypted index is obtained by simplifying the concrete schemes, and its adaptive security can be proved,

Hangar

Obverse

A New Design of Online/Offline Signatures Based on Latticeare urgently demanded. Among these primitives, online/offline signatures are one of the most promising one. Motivated by this situation, we propose a lattice-based online/offline signature scheme by using the hash-sign-switch paradigm, which was introduced by Shamir and Tauman in 2001. Our scheme no

cogitate

CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case verifiable by a third party while the input data remains confidential. We introduce CHQS, a homomorphic signature scheme from bilinear groups fulfilling these requirements. CHQS is the first such scheme to be both context hiding and publicly verifiable for arithmetic circuits of degree 2. It also a

把…比做

SSRIS