Search
Search Results
-
Indistinguishability Obfuscation from LPN over \(\mathbb {F}_p\) , DLIN, and PRGs in NC \(^0\)
In this work, we study what minimal sets of assumptions suffice for constructing indistinguishability obfuscation (...
-
Compact NIZKs from Standard Assumptions on Bilinear Maps
A non-interactive zero-knowledge (NIZK) protocol enables a prover to convince a verifier of the truth of a statement without leaking any other...
-
Improved Reranking Approach for Person Re-identification System
Safety is ensured in all the public places with the help of surveillance cameras. It can be used to find any person involved in crime or lost person....
-
Unbounded Revocable Decentralized Multi-Authority Attribute-Based Encryption Supporting Non-monotone Access Structures
Ciphertext-policy attribute-based encryption (CP-ABE) is a cryptographic technology that enforces an access control mechanism over encrypted data by...
-
Receiver selective opening security for identity-based encryption in the multi-challenge setting
Receiver selective opening (RSO) security requires that in a situation where there are one sender and multiple receivers, even if an adversary has...
-
Attribute Based Encryption for Deterministic Finite Automata from \(\mathsf{DLIN}\)
Waters [Crypto, 2012] provided the first attribute based encryption scheme ABE for Deterministic Finite Automata (DFA) from a parametrized or...
-
Verifiable Private Information Retrieval
A computational PIR scheme allows a client to privately query a database hosted on a single server without downloading the entire database. We...
-
Homomorphic Signatures for Subset and Superset Mixed Predicates and Its Applications
In homomorphic signatures for subset predicates (HSSB), each message (to be signed) is a set. Any signature on a set M allows us to derive a...
-
Attribute-Based Signatures for Range of Inner Product and Its Applications
In attribute-based signatures (ABS) for inner products, the digital signature analogue of attribute-based encryption for inner products (Katz et al.,...
-
Anonymous attribute-based broadcast encryption with hidden multiple access structures
Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the...
-
Syntax Checking Either Way
We consider parsers of deterministic context-free languages and study the sizes of their syntax checking components. More precisely, we allow the...
-
Compact NIZKs from Standard Assumptions on Bilinear Maps
A non-interactive zero-knowledge (NIZK) protocol enables a prover to convince a verifier of the truth of a statement without leaking any other...
-
A Simple and Efficient Framework of Proof Systems for NP
In this work, we propose a simple framework of constructing efficient non-interactive zero-knowledge proof (NIZK) systems for all...
-
Short attribute-based signatures for arbitrary Turing machines from standard assumptions
This paper presents the first attribute-based signature (
ABS ) scheme supporting signing policies representable by Turing machines (TM ), based on well-s...
-
Statistical ZAPR Arguments from Bilinear Maps
Dwork and Naor (FOCS ’00) defined ZAPs as 2-message witness-indistinguishable proofs that are public-coin. We relax this to ZAPs with private...
-
Key-Range Attribute-Based Signatures for Range of Inner Product and Its Applications
In attribute-based signatures (ABS) for range of inner product (ARIP), recently proposed by Ishizaka and Fukushima at ICISC 2022, a secret-key...
-
Efficient Designated-Server Proxy Re-encryption with Keyword Search for Big Data
Against the background of the era of big data and cloud computing, cloud platforms have become the first choice for data storage. While cloud...
-
Verifiable and Boolean keyword searchable attribute-based signcryption for electronic medical record storage and retrieval in cloud computing environment
Cloud-based electronic medical record (EMR) management system is an emerging paradigm that enables EMR owners to store and share their EMRs with...
-
Verifiable Inner Product Encryption Scheme
In the standard setting of functional encryption (FE), we assume both the Central Authority (CA) and the encryptors to run their respective...