搜索结果: 1-15 共查到“密码学 Fully Secure”相关记录30条 . 查询时间(0.109 秒)
On Fully Secure MPC with Solitary Output
Multi-Party Computation Full Security Dishonest Majority Malicious Adversaries
2019/9/17
We study the possibility of achieving full security, with guaranteed output delivery, for secure multiparty computation of functionalities where only one party receives output, to which we refer as so...
Fully Secure Attribute-Based Encryption for $t$-CNF from LWE
attribute-based encryption ABE ciphertext policy
2019/4/10
Attribute-based Encryption (ABE), first introduced by [SW05,GPSW06], is a public key encryption system that can support multiple users with varying decryption permissions. One of the main properties o...
Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo $p$
Inner Product Functional Encryption Adaptive Security Diffie-Hellman Assumptions
2018/9/6
Functional encryption is a modern public-key cryptographic primitive allowing an encryptor to finely control the information revealed to recipients from a given ciphertext. Abdalla, Bourse, De Caro, a...
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...
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
Fairness Secure Two-Party Computation Malicious Adversaries
2017/2/20
In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossib...
How to Build Fully Secure Tweakable Blockciphers from Classical Blockciphers
tweakable blockcipher full security ideal blockcipher
2016/12/9
This paper focuses on building a tweakable blockcipher from a classical blockcipher whose input and output wires all have a size of nn bits. The main goal is to achieve full 2n2n security. Such a twea...
We construct an identity-based encryption (IBE) scheme from the standard Learning with Errors
(LWE) assumption, which both has a compact public-key (with size similar to known lattice-based PKE
sche...
Fully secure constrained pseudorandom functions using random oracles
constrained pseudorandom functions adaptive security non-interactive key exchange
2016/1/9
A constrained pseudorandom function (CPRF) PRF allows to derive constrained evaluation
keys that only allow to evaluate PRF on a subset of inputs. CPRFs have only recently been
introduced independen...
Dual System Encryption via Doubly Selective Security: Framework, Fully-secure Functional Encryption for Regular Languages, and More
Dual system encryption Functional encryption for regular languages Attribute-based encryption
2016/1/9
Dual system encryption techniques introduced by Waters in Crypto’09 are powerful approaches
for constructing fully secure functional encryption (FE) for many predicates. However,
there are still som...
Fully Secure and Fast Signing from Obfuscation
public-key cryptography obfuscation digital signatures
2016/1/8
In this work we explore new techniques for building short signatures from obfuscation. Our goals are
twofold. First, we would like to achieve short signatures with adaptive security proofs. Second, w...
Fully Secure Attribute Based Encryption from Multilinear Maps
attribute based encryption adaptive security multilinear maps
2016/1/8
We construct the first fully secure attribute based encryption (ABE) scheme that can handle access control policies expressible as polynomial-size circuits. Previous ABE schemes for general circuits w...
Fully Secure and Succinct Attribute Based Encryption for Circuits from Multi-linear Maps
Attribute-based encryption for circuits Full security Multi-linear maps
2016/1/7
We propose new fully secure attribute based encryption (ABE) systems for polynomialsize
circuits in both key-policy and ciphertext-policy flavors. All the previous ABE systems
for circuits were prov...
Fully Secure Self-Updatable Encryption in Prime Order Bilinear Groups
public-key encryption self-updatable encryption ciphertext update
2016/1/5
In CRYPTO 2012, Sahai et al. raised the concern that in a cloud control system revocation
of past keys should also be accompanied by updation of previously generated ciphertexts in
order to prevent ...
Fully Secure Unbounded Revocable Attribute-Based Encryption in Prime Order Bilinear Groups via Subset Difference Method
attribute-based encryption revocable attribute-based encryption key revocation
2015/12/31
Providing an efficient revocation mechanism for attribute-based encryption (ABE) is of
utmost importance since over time an user’s credentials may be revealed or expired. All previously
known revoca...
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions
Functional encryption adaptive security standard assumptions
2015/12/29
Functional encryption is a modern public-key paradigm where
a master secret key can be used to derive sub-keys SKF associated
with certain functions F in such a way that the decryption operation
re...