687 research outputs found
Optimal Bounded-Collusion Secure Functional Encryption
We construct private-key and public-key functional encryption schemes secure against adversaries that corrupt an a-priori bounded number of users and obtain their functional keys, from minimal assumptions.
For a collusion bound of (where is the security parameter), our public-key (resp. private-key) functional encryption scheme (a) supports the class of all polynomial-size circuits; (b) can be built solely from a vanilla public-key (resp. private-key) encryption scheme; and (c) has ciphertexts that grow linearly with the collusion bound . Previous constructions were sub-optimal with respect to one or more of the above properties.
The first two of these properties are the best possible and any improvement in the third property, namely the ciphertext size dependence on the collusion bound , can be used to realize an indistinguishability obfuscation scheme.
In addition, our schemes are adaptively secure and make black-box use of the underlying cryptographic primitives
Bounded-Collusion IBE from Key Homomorphism
In this work, we show how to construct IBE schemes that are secure against a bounded number of collusions, starting with underlying PKE schemes which possess linear homomorphisms over their keys. In particular, this enables us to exhibit a new (bounded-collusion) IBE construction based on the quadratic residuosity assumption, without any need to assume the existence of random oracles. The new IBE’s public parameters are of size O(tλlogI) where I is the total number of identities which can be supported by the system, t is the number of collusions which the system is secure against, and λ is a security parameter. While the number of collusions is bounded, we note that an exponential number of total identities can be supported.
More generally, we give a transformation that takes any PKE satisfying Linear Key Homomorphism, Identity Map Compatibility, and the Linear Hash Proof Property and translates it into an IBE secure against bounded collusions. We demonstrate that these properties are more general than our quadratic residuosity-based scheme by showing how a simple PKE based on the DDH assumption also satisfies these properties.National Science Foundation (U.S.) (NSF CCF-0729011)National Science Foundation (U.S.) (NSF CCF-1018064)United States. Defense Advanced Research Projects Agency (DARPA FA8750-11-2-0225
Dynamic Collusion Bounded Functional Encryption from Identity-Based Encryption
Functional Encryption is a powerful notion of encryption in which each decryption key is associated with a function such that decryption recovers the function evaluation . Informally, security states that a user with access to function keys (and so on) can only learn (and so on) but nothing more about the message. The system is said to be -bounded collusion resistant if the security holds as long as an adversary gets access to at most function keys. A major drawback of such statically bounded collusion systems is that the collusion bound must be declared at setup time and is fixed for the entire lifetime of the system.
We initiate the study of dynamically bounded collusion resistant functional encryption systems which provide more flexibility in terms of selecting the collusion bound, while reaping the benefits of statically bounded collusion FE systems (such as quantum resistance, simulation security, and general assumptions).
Briefly, the virtues of a dynamically bounded scheme can be summarized as:
(i) [Fine-grained individualized selection.] It lets each encryptor select the collusion bound by weighing the trade-off between performance overhead and the amount of collusion resilience.
(ii) [Evolving encryption strategies.] Since the system is no longer tied to a single collusion bound, thus it allows to dynamically adjust the desired collusion resilience based on any number of evolving factors such as the age of the system, or a number of active users, etc.
(iii) [Ease and simplicity of updatability.] None of the system parameters have to be updated when adjusting the collusion bound. That is, the same key can be used to decrypt ciphertexts for collusion bound as well as .
We construct such a dynamically bounded functional encryption scheme for the class of all polynomial-size circuits under the general assumption of Identity-Based Encryption
Indistinguishability Obfuscation from Well-Founded Assumptions
In this work, we show how to construct indistinguishability obfuscation from
subexponential hardness of four well-founded assumptions. We prove:
Let be arbitrary
constants. Assume sub-exponential security of the following assumptions, where
is a security parameter, and the parameters below are
large enough polynomials in :
- The SXDH assumption on asymmetric bilinear groups of a prime order ,
- The LWE assumption over with subexponential
modulus-to-noise ratio , where is the dimension of the LWE
secret,
- The LPN assumption over with polynomially many LPN samples
and error rate , where is the dimension of the LPN
secret,
- The existence of a Boolean PRG in with stretch
,
Then, (subexponentially secure) indistinguishability obfuscation for all
polynomial-size circuits exists
Functional Encryption with Secure Key Leasing
Secure software leasing is a quantum cryptographic primitive that enables us to lease software to a user by encoding it into a quantum state. Secure software leasing has a mechanism that verifies whether a returned software is valid or not. The security notion guarantees that once a user returns a software in a valid form, the user no longer uses the software.
In this work, we introduce the notion of secret-key functional encryption (SKFE) with secure key leasing, where a decryption key can be securely leased in the sense of secure software leasing. We also instantiate it with standard cryptographic assumptions. More specifically, our contribution is as follows.
- We define the syntax and security definitions for SKFE with secure key leasing.
- We achieve a transformation from standard SKFE into SKFE with secure key leasing without using additional assumptions. Especially, we obtain bounded collusion-resistant SKFE for with secure key leasing based on post-quantum one-way functions since we can instantiate bounded collusion-resistant SKFE for with the assumption.
Some previous secure software leasing schemes capture only pirate software that runs on an honest evaluation algorithm (on a legitimate platform). However, our secure key leasing notion captures arbitrary attack strategies and does not have such a limitation.
As an additional contribution, we introduce the notion of single-decryptor FE (SDFE), where each functional decryption key is copy-protected. Since copy-protection is a stronger primitive than secure software leasing, this notion can be seen as a stronger cryptographic primitive than FE with secure key leasing. More specifically, our additional contribution is as follows.
- We define the syntax and security definitions for SDFE.
- We achieve collusion-resistant single-decryptor PKFE for from post-quantum indistinguishability obfuscation and quantum hardness of the learning with errors problem
Public Key Encryption with Secure Key Leasing
We introduce the notion of public key encryption with secure key leasing
(PKE-SKL). Our notion supports the leasing of decryption keys so that a leased
key achieves the decryption functionality but comes with the guarantee that if
the quantum decryption key returned by a user passes a validity test, then the
user has lost the ability to decrypt. Our notion is similar in spirit to the
notion of secure software leasing (SSL) introduced by Ananth and La Placa
(Eurocrypt 2021) but captures significantly more general adversarial
strategies. In more detail, our adversary is not restricted to use an honest
evaluation algorithm to run pirated software. Our results can be summarized as
follows:
1. Definitions: We introduce the definition of PKE with secure key leasing
and formalize security notions.
2. Constructing PKE with Secure Key Leasing: We provide a construction of
PKE-SKL by leveraging a PKE scheme that satisfies a new security notion that we
call consistent or inconsistent security against key leasing attacks (CoIC-KLA
security). We then construct a CoIC-KLA secure PKE scheme using 1-key
Ciphertext-Policy Functional Encryption (CPFE) that in turn can be based on any
IND-CPA secure PKE scheme.
3. Identity Based Encryption, Attribute Based Encryption and Functional
Encryption with Secure Key Leasing: We provide definitions of secure key
leasing in the context of advanced encryption schemes such as identity based
encryption (IBE), attribute-based encryption (ABE) and functional encryption
(FE). Then we provide constructions by combining the above PKE-SKL with
standard IBE, ABE and FE schemes.Comment: 68 pages, 4 figures. added related works and a comparison with a
concurrent work (2023-04-07
- …