Search
Search Results
-
Compact Structure-Preserving Signatures with Almost Tight Security
In structure-preserving cryptography, every building block shares the same bilinear groups. These groups must be generated for a specific, a priori...
-
Cryptanalysis of the CLT13 Multilinear Map
In this paper, we describe a polynomial time cryptanalysis of the (approximate) multilinear map proposed by Coron, Lepoint, and Tibouchi in Crypto13...
-
Anonymous Permutation Routing
The Non-Interactive Anonymous Router (NIAR) model was introduced by Shi and Wu [SW21] as an alternative to conventional solutions to the anonymous...
-
On the Impossibility of Algebraic NIZK in Pairing-Free Groups
Non-Interactive Zero-Knowledge proofs (NIZK) allow a prover to convince a verifier that a statement is true by sending only one message and without...
-
Towards Accountability in CRS Generation
It is well known that several cryptographic primitives cannot be achieved without a common reference string (CRS). Those include, for instance,...
-
Generic constructions of master-key KDM secure attribute-based encryption
Master-key key-dependent message (mKDM) security is a strong security notion for attribute-based encryption (ABE) schemes, which has been...
-
CP-ABE for Circuits (and More) in the Symmetric Key Setting
The celebrated work of Gorbunov, Vaikuntanathan and Wee [GVW13] provided the first key policy attribute based encryption scheme (ABE) for circuits...
-
On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption
Homomorphic encryption (HE) is public key encryption that enables computation over ciphertexts without decrypting them, while it is known that HE...
-
Compact Designated Verifier NIZKs from the CDH Assumption Without Pairings
In a non-interactive zero-knowledge (NIZK) proof, a prover can non-interactively convince a verifier of a statement without revealing any additional...
-
Shorter Non-interactive Zero-Knowledge Arguments and ZAPs for Algebraic Languages
We put forth a new framework for building pairing-based non-interactive zero-knowledge (...
-
A Survey on Automata with Translucent Letters
In this survey we present the various types of automata with translucent letters that have been studied in the literature. These include the finite...
-
Leakage-Resilient Key Exchange and Two-Seed Extractors
Can Alice and Bob agree on a uniformly random secret key without having any truly secret randomness to begin with? Here we consider a setting where...
-
Decentralized Multi-authority Anonymous Credential System with Bundled Languages on Identifiers
We propose an anonymous credential system equipped with independent decentralized authorities who issue credentials. In our system, the number of...
-
Function-Revealing Encryption
Multi-input functional encryption is a paradigm that allows an authorized user to compute a certain function—and nothing more—over multiple...
-
An Efficient Dynamic Group Signatures Scheme with CCA-Anonymity in Standard Model
Group signatures is a cryptographic primitive, simultaneously supporting anonymity and traceability. Though many group signatures schemes have been...
-
Expected Constant Round Byzantine Broadcast Under Dishonest Majority
Byzantine Broadcast (BB) is a central question in distributed systems, and an important challenge is to understand its round complexity. Under the...
-
Broadcast, Trace and Revoke with Optimal Parameters from Polynomial Hardness
A broadcast, trace and revoke system generalizes broadcast encryption as well as traitor tracing. In such a scheme, an encryptor can specify a list...
-
Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Verifiable random functions (VRFs) are pseudorandom functions where the owner of the seed, in addition to computing the function’s value y at any...
-
New Assumptions on Isogenous Pairing Groups with Applications to Attribute-Based Encryption
We introduce new isogeny-related assumptions called Isog-DDH and Isog-DBDH assumptions. By using the assumptions, we reinforce security of several...
-
Towards Enhanced Security for Certificateless Public-Key Authenticated Encryption with Keyword Search
Certificateless Public-key Authenticated Encryption with Keyword Search (CLPAEKS) is derived from the Public-key Authenticated Encryption with...