搜索结果: 1-15 共查到“unbounded”相关记录66条 . 查询时间(0.087 秒)
Efficient Tightly-Secure Structure-Preserving Signatures and Unbounded Simulation-Sound QA-NIZK Proofs
Structure-preserving signatures QA-NIZK simulation-soundness
2019/9/16
We show how to construct structure-preserving signatures (SPS) and unbounded quasi-adaptive non-interactive zero-knowledge (USS QA-NIZK) proofs with a tight security reduction to simple assumptions, b...
A Modified Simple Substitution Cipher With Unbounded Unicity Distance
finite-key unicity randomization
2019/6/4
The classic simple substitution cipher is modified by randomly inserting key-defined noise characters into the ciphertext in encryption which are ignored in decryption. Interestingly, this yields a fi...
Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs
attribute-based signatures arithmetic branching programs arithmetic span programs
2019/4/10
This paper presents the first attribute-based signature (ABS) scheme in which the correspondence between signers and signatures is captured in an arithmetic model of computation. Specifically, we desi...
Unbounded Dynamic Predicate Compositions in Attribute-Based Encryption
attribute-based encryption predicate encryption nested policy
2019/3/4
We present several transformations that combine a set of attribute-based encryption (ABE) schemes for simpler predicates into a new ABE scheme for more expressive composed predicates. Previous proposa...
Attribute-Based Signatures for Unbounded Languages from Standard Assumptions
attribute-based signatures Groth-Sahai proofs structure-preserving signatures
2018/11/16
Attribute-based signature (ABS) schemes are advanced signature schemes that simultaneously provide fine-grained authentication while protecting privacy of the signer. Previously known expressive ABS s...
Unbounded Inner Product Functional Encryption from Bilinear Maps
functional encryption inner product function hiding
2018/7/20
Inner product functional encryption (IPFE), introduced by Abdalla et al. (PKC2015), is a kind of functional encryption supporting only inner product functionality. All previous IPFE schemes are bounde...
Unbounded Inner Product Functional Encryption, with Succinct Keys
Unbounded Vectors Functional Encryption Inner Product
2018/5/28
In 2015, Abdalla et al. introduced Inner Product Functional Encryption, where both ciphertexts and decryption keys are vectors of fixed size nn, and keys enable the computation of an inner product bet...
Unbounded ABE via Bilinear Entropy Expansion, Revisited
public-key cryptography attribute-based encryption
2018/2/1
At the core of all of these constructions is a "bilinear entropy expansion" lemma that allows us to generate any polynomial amount of entropy starting from constant-size public parameters; the entropy...
A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples
Lattices LWE Learning with Rounding
2018/1/30
The learning with rounding problem (LWR) has become a popular cryptographic assumption to study recently due to its determinism and resistance to known quantum attacks. Unfortunately, LWR is only know...
Full-Hiding (Unbounded) Multi-Input Inner Product Functional Encryption from the $k$-Linear Assumption
multi-input functional encryption inner products full-hiding security
2018/1/17
This paper presents two non-generic and practically efficient private key multi-input functional encryption (MIFE) schemes for the multi-input version of the inner product functionality that are the f...
Attribute-based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices
Attribute-based signatures generic constructions lattices
2018/1/11
In this work, we affirmatively close the gap between ABS schemes based on bilinear maps and lattices by constructing the first lattice-based ABS scheme for unbounded circuits in the random oracle mode...
Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits
Attribute-based encryption Full security Unbounded-size Circuits
2017/2/20
We propose a new generic framework for constructing fully secure attribute based encryption (ABE) in multilinear settings. It is applicable in a generic manner to any predicates. Previous generic fram...
Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
Circular Security every IND-CPA cryptosystem
2017/2/20
One interesting question is whether circular security comes for free from IND-CPA security. Recent works have addressed this question, showing that for all integers n, there exists an IND-CPA scheme t...
A constrained pseudorandom function (CPRF) F:K×X→Y for a family T of subsets of X is a function where for any key k∈K and set S∈T one can efficiently compute a short constrained key kS, which allows t...
Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group Model
Automated analysis Generic Group Model Structure-Preserving Signatures
2016/3/11
We develop a new method to automatically prove security
statements in the Generic Group Model as they occur in actual papers.
We start by defining (i) a general language to describe security definit...