搜索结果: 1-15 共查到“inputs”相关记录73条 . 查询时间(0.082 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Synthesis of robust memory modes for linear quantum systems with unknown inputs
未知输入 线性量子系统 鲁棒记忆模式
2023/11/7
In this work, synthesis of robust memory modes for linear quantum passive systems in the presence of unknown inputs has been studied, aimed at facilitating secure storage and communication of quantum ...
Oblivious PRF on Committed Vector Inputs and Application to Deduplication of Encrypted Data
public-key cryptography applications pseudo-random functions
2019/5/5
Ensuring secure deduplication of encrypted data is a very active topic of research because deduplication is effective at reducing storage costs. Schemes supporting deduplication of encrypted data that...
Candidate Differing-Inputs Obfuscation from Indistinguishability Obfuscation and Auxiliary-Input Point Obfuscation
Indistinguishability Obfuscation Auxiliary-Input Point Obfuscation
2018/11/2
Differing-inputs obfuscation (diO), first proposed by Barak et. al. [4], provides stronger security than that provided by indistinguishability obfuscation (iO). An iO scheme provides indistinguishabil...
Improved Signature Schemes for Secure Multi-Party Computation with Certified Inputs
cryptographic protocols Certified Inputs
2018/8/16
The motivation for this work comes from the need to strengthen security of secure multi-party protocols with the ability to guarantee that the participants provide their truthful inputs in the computa...
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
indistinguishability obfuscation extremely lossy functions subexponential assumptions
2018/5/23
We consider the problem of removing subexponential assumptions from cryptographic constructions based on indistinguishability obfuscation (iO). Specifically, we show how to apply complexity absorption...
Breaking and Fixing Secure Similarity Approximations: Dealing with Adversarially Perturbed Inputs
Secure Approximation Protocol Secure Sketching Jaccard Similarity
2017/9/13
Computing similarity between data is a fundamental problem in information retrieval and data mining. To address the relevant performance and scalability challenges, approximation methods are employed ...
Strong Authenticated Key Exchange with Auxiliary Inputs
cryptographic protocols Authenticated Key Exchange
2017/5/16
Leakage attacks, including various kinds of side-channel attacks, allow an attacker to learn partial information about the internal secrets such as the secret key and the randomness of a cryptographic...
Verifiable and Delegatable Constrained Pseudorandom Functions for Unconstrained Inputs
constrained pseudorandom functions verifiable constrained pseudorandom function key delegation
2016/12/10
Constrained pseudorandom functions (CPRF) are a fundamental extension of the notion of traditional pseudorandom functions (PRF). A CPRF enables a master PRF key holder to issue constrained keys corres...
For any pair (X,Z)(X,Z) of correlated random variables we can think of ZZ as a randomized function of XX. If the domain of ZZ is small, one can make this function computationally efficient by allowing...
EVALUATION OF VARIOUS SPECTRAL INPUTS FOR ESTIMATION OF FOREST BIOCHEMICAL AND STRUCTURAL PROPERTIES FROM AIRBORNE IMAGING SPECTROSCOPY DATA
Airborne imaging spectroscopy DART Chlorophyll content Continuum removal Leaf area index Forest Support vector regression Radiative transfer modelling
2016/11/24
In this study we evaluated various spectral inputs for retrieval of forest chlorophyll content (Cab) and leaf area index (LAI) from high spectral and spatial resolution airborne imaging spectroscopy d...
美国戴维斯加利福尼亚大学高级国际贸易课件Chapter 4: Trade in Intermediate Inputs and Wages
美国戴维斯加利福尼亚大学 高级国际贸易 课件 Chapter 4 Trade in Intermediate Inputs Wages
2020/2/21
美国戴维斯加利福尼亚大学高级国际贸易课件Chapter 4: Trade in Intermediate Inputs and Wages。
A constrained pseudo random function (PRF) behaves like a standard PRF, but with the added feature that the (master) secret key holder, having secret key K, can produce a constrained key, K{f}, that a...
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...
Attribute-Based Fully Homomorphic Encryption with a Bounded Number of Inputs
attribute based encryption fully homomorphic encryption LWE
2016/2/23
The only known way to achieve Attribute-based Fully Homomorphic Encryption (ABFHE)
is through indistinguishability obfsucation. The best we can do at the moment without obfuscation is
Attribute-Base...
We provide the following negative results for differing-inputs obfuscation (diO): (1) If subexponentially
secure one-way functions exist then sub-exponentially secure diO for TMs does
not exist (2) ...