搜索结果: 1-15 共查到“collusion”相关记录49条 . 查询时间(0.045 秒)
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
public-key cryptography traitor tracing, revocation
2019/8/30
A traitor tracing scheme is a multi-user public-key encryption scheme where each user in the system holds a decryption key that is associated with the user's identity. Using the public key, a content ...
Optimal Bounded-Collusion Secure Functional Encryption
Bounded-Key Functional Encryption Correlated Garbling
2019/3/22
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 assumpt...
Collusion Resistant Broadcast and Trace from Positional Witness Encryption
Witness Encryption Trace and Revoke Broadcast Encryption
2019/1/18
An emerging trend is for researchers to identify cryptography primitives for which feasibility was first established under obfuscation and then move the realization to a different setting. In this wor...
A CCA-secure collusion-resistant Identity-based Proxy Re-encryption Scheme
Identity-Based Proxy Re-Encryption Collusion-resistance Random Oracle
2018/11/29
Cloud storage enables its users to store confidential information as encrypted files in the cloud. A cloud user (say Alice) can share her encrypted files with another user (say Bob) by availing proxy ...
A Bit-fixing PRF with O(1) Collusion-Resistance from LWE
Constrained PRF Collusion-resistance LWE
2018/11/9
Constrained pseudorandom functions (CPRFs) allow learning modified PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh and ...
Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance
Constrained PRF collusion-resistance one-way functions
2018/11/8
Constrained pseudorandom functions (CPRFs) are a type of PRFs that allows one to derive a constrained key KCKC from the master key KK. While the master key KK allows one to evaluate on any input as a ...
Constrained PRFs for Bit-fixing from OWFs with Constant Collusion Resistance
Constrained PRF Collusion-resistance One-way functions
2018/11/5
Constrained pseudorandom functions (CPRFs) allow learning `constrained' PRF keys that can evaluate the PRF on a subset of the input space, or based on some sort of predicate. First introduced by Boneh...
Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing
Verifiable Computing Smart Contract Game Theory
2018/5/28
Cloud computing has become an irreversible trend. Together comes the pressing need for verifiability, to assure the client the correctness of computation outsourced to the cloud. Existing verifiable c...
In this work we provide a traitor tracing construction with ciphertexts that grow polynomially in log(n) where n is the number of users and prove it secure under the Learning with Errors (LWE) assumpt...
Collusion Resistant Watermarking Schemes for Cryptographic Functionalities
Watermarking Scheme Private Constrained Pseudorandom Function Collusion Resilience
2017/12/19
A cryptographic watermarking scheme embeds message into a program while preserving its functionality. Essential security of the watermarking schemes requires that no one could remove the marking messa...
From Single-Key to Collusion-Resistant Secret-Key Functional Encryption by Leveraging Succinctness
Secret-key functional encryption Collusion-resistance Succinctness
2017/7/4
We show how to construct secret-key functional encryption (SKFE) supporting unbounded polynomially many functional decryption keys, that is, collusion-resistant SKFE solely from SKFE supporting only o...
Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion
Non-interactive multiparty computation private simulatenous messages
2017/6/9
Non-Interactive Multiparty Computations (Beimel et al., Crypto 2014) is a very powerful notion equivalent (under some corruption model) to garbled circuits, Private Simultaneous Messages protocols, an...
Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions
attribute-based encryption public-key encryption bounded collusion
2017/2/20
Attribute-based encryption (ABE) enables encryption of messages under access policies so that only users with attributes satisfying the policy can decrypt the ciphertext. In standard ABE, an arbitrary...
Collusion Resistant Broadcast Encryption with Tight Reductions and Beyond
Broadcast Encryption Tight Reduction
2016/12/8
The issue of tight security in identity-based encryption scheme (IBE) has been widely investigated.
Recently, a tightly secure IBE scheme of bilinear groups in the weak multi-challenge setting has be...
Novel Inner Product Encryption Resistant to Partial Collusion Attacks
Inner Product Encryption Selective Security Bilinear Paring
2016/12/7
Inner product encryption (IPE) is a new cryptographic primitive initially
proposed by Abdalla et al. in 2015. IPE can be classified into public-key
IPE and secret-key IPE. The currently proposed PK-...