搜索结果: 1-8 共查到“军事学 languages”相关记录8条 . 查询时间(0.078 秒)
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...
Indistinguishability Obfuscation Does Not Reduce to Structured Languages
indistinguishability obfuscation one-way functions
2016/6/6
We prove that indistinguishability obfuscation (iO) and one-way functions do not naturally
reduce to any language within NP∩coNP. This is proved within the framework introduced by
Asharov and Segev ...
Adaptively Secure Functional Encryption for Finite Languages from DLIN Assumption
Functional encryption Attribute-based encryption DFA
2016/1/23
In this paper, we present Functional Encryption (FE) schemes for finite languages from standard static assumption, viz., Decisional Linear (DLIN) assumption. These finite languages are described by ...
Towards Symmetric Functional Encryption for Regular Languages with Predicate Privacy
symmetric functional encryption deterministic finite automaton regular language
2016/1/9
We present a symmetric-key predicate-only functional encryption
system, SP-FE, which supports functionality for regular languages
described by deterministic finite automata. In SP-FE, a data
owner ...
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...
Practical Witness Encryption for Algebraic Languages And How to Reply an Unknown Whistleblower
Witness encryption smooth projective hash functions ring signatures
2015/12/21
Witness encryption (WE) is a recent powerful encryption paradigm. It greatly
extends the scope of encryption as it allows to encrypt a message using the description
of a hard problem (a word in some...
Functional Encryption Supporting Recursive Languages
functional encryption recursive languages pushdown automata
2013/4/18
We provide a construction for functional encryption over the set of recursive languages. In this scheme, a secret key $\sk_{\mathcal{M}}$ encodes a halting double-stack deterministic pushdown automato...
Which Languages Have 4-Round Zero-Knowledge Proofs
Languages 4-Round Zero-Knowledge Proofs
2008/8/18
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof
system with negligible soundness error, then L ∈ MA. Assuming the polynomial hierarchy
does not collapse, th...