搜索结果: 1-15 共查到“军事学 Standard Assumptions”相关记录32条 . 查询时间(0.097 秒)
Collusion Resistant Trace-and-Revoke for Arbitrary Identities from Standard Assumptions
public-key cryptography traitor tracing, revocation
font style='font-size:12px;'>
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 ...
Non-zero Inner Product Encryptions: Strong Security under Standard Assumptions
non-zero inner product encryptions adaptive security payload- hiding
font style='font-size:12px;'>
2019/7/15
Non-zero inner product encryption (NIPE) allows a user to encrypt a message with its attribute vector and decryption is possible using a secret-key associated with a predicate vector if the inner prod...
Broadcast and Trace with N^epsilon Ciphertext Size from Standard Assumptions
public-key cryptography Standard Assumptions
font style='font-size:12px;'>
2019/6/4
We construct a broadcast and trace scheme (also known as trace and revoke or broadcast, trace and revoke) with NN users, where the ciphertext size can be made as low as O(Nϵ)O(Nϵ), for any...
Lelantus: Towards Confidentiality and Anonymity of Blockchain Transactions from Standard Assumptions
Zero-knowledge Proofs Confidential Transactions Zcoin
font style='font-size:12px;'>
2019/4/15
We propose Lelantus, a new anonymous payment system which ensures both transaction confidentiality and anonymity with small proof sizes, short verification times and without requiring a trusted setup.
Ring Signatures: Logarithmic-Size, No Setup --- from Standard Assumptions
ring signatures linkable ring signatures standard model
font style='font-size:12px;'>
2019/3/1
Ring signatures allow for creating signatures on behalf of an ad hoc group of signers, hiding the true identity of the signer among the group. A natural goal is to construct a ring signature scheme fo...
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
font style='font-size:12px;'>
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...
Robustly Reusable Fuzzy Extractor from Standard Assumptions
Fuzzy extractor Reusability Robustness Standard assumptions
font style='font-size:12px;'>
2018/11/19
A fuzzy extractor (FE) aims at deriving and reproducing (almost) uniform cryptographic keys from noisy non-uniform sources. To reproduce an identical key R from subsequent readings of a noisy source, ...
Attribute-Based Signatures for Unbounded Languages from Standard Assumptions
attribute-based signatures Groth-Sahai proofs structure-preserving signatures
font style='font-size:12px;'>
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...
Watermarking PRFs under Standard Assumptions: Public Marking and Security with Extraction Queries
Extraction Queries PRF
font style='font-size:12px;'>
2018/11/9
A software watermarking scheme can embed some information called a mark into a program while preserving its functionality. No adversary can remove the mark without damaging the functionality of the pr...
Registration-Based Encryption from Standard Assumptions
Registration-based encryption Identity-based encryption Garbling
font style='font-size:12px;'>
2018/11/2
The notion of Registration-Based Encryption (RBE) was recently introduced by Garg, Hajiabadi, Mahmoody, and Rahimi [TCC'18] with the goal of removing the private-key generator (PKG) from IBE. Specific...
Strongly Unforgeable Signatures Resilient to Polynomially Hard-to-Invert Leakage under Standard Assumptions
Digital signature Strong existential unforgeability Leakage-resilience
font style='font-size:12px;'>
2018/11/2
A signature scheme is said to be weakly unforgeable, if it is hard to forge a signature on a message not signed before. A signature scheme is said to be strongly unforgeable, if it is hard to forge a ...
On Publicly Verifiable Delegation From Standard Assumptions
Standard Assumptions
font style='font-size:12px;'>
2018/8/28
We construct a publicly verifiable non-interactive delegation scheme for log-space uniform bounded depth computations in the common reference string (CRS) model, where the CRS is long (as long as the ...
G-Merkle: A Hash-Based Group Signature Scheme From Standard Assumptions
Hash-based Crypto One-Way Functions Group Signatures
font style='font-size:12px;'>
2018/3/23
Hash-based signature schemes are the most promising cryptosystem candidates in a post-quantum world, but offer little structure to enable more sophisticated constructions such as group signatures. Gro...
Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions
selective opening public-key cryptography SIM-SO-CCA
font style='font-size:12px;'>
2018/1/11
Selective opening security (SO security) is desirable for public key encryption (PKE) in a multi-user setting. {In a selective opening attack, an adversary receives a number of ciphertexts for possibl...
Weakly Secure Equivalence-Class Signatures from Standard Assumptions
Structure-preserving signatures security proof standard assumptions
font style='font-size:12px;'>
2018/1/11
Structure-preserving signatures on equivalence classes, or equivalence-class signatures for short (EQS), are signature schemes defined over bilinear groups whose messages are vectors of group elements...