搜索结果: 1-11 共查到“军事学 Separations”相关记录11条 . 查询时间(0.093 秒)
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
Collision Resistance Statistical Zero Knowledge Black box separations
2019/6/12
The complexity of collision-resistant hash functions has been long studied in the theory of cryptography. While we often think about them as a Minicrypt primitive, black-box separations demonstrate th...
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
Communication Complexity Conditional Disclosure of Secrets Amplification
2017/2/24
In the \emph{conditional disclosure of secrets} problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold inputs xx and yy respectively, wish to release a common secret ss to Carol...
Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions
Black-box separations circular security
2017/2/21
We address the problems of whether t-circular-secure encryption can be based on (t-1)-circular-secure encryption or on semantic (CPA) security, if t = 1. While for t = 1 a folklore construction, based...
Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems
Matrix Diffie-Hellman Problems Black-Box Reductions Decisional Linear Assumption
2017/2/20
In this paper we provide new algebraic tools to study the relationship between different Matrix Diffie-Hellman (MDDH) Problems, which are recently introduced as a natural generalization of the so-call...
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
black-box separation public key encryption one-way function
2016/12/10
Separating public key encryption from one way functions is one of the fundamental goals of complexity-based cryptography. Beginning with the seminal work of Impagliazzo and Rudich (STOC, 1989), a sequ...
KDM Security for Identity-Based Encryption: Constructions and Separations
KDM security IBE IB-HPS
2016/12/8
For encryption schemes, key dependent message (KDM) security requires that ciphertexts preserve secrecy even when the encrypt messages may depend on the secret keys. While KDM security has been extens...
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
random oracle model idealized models indistinguishability obfuscation
2016/1/6
It is well known that the random oracle model is not sound in the sense that there exist
cryptographic systems that are secure in the random oracle model but when instantiated by any
family of hash ...
Black Box Separations for Differentially Private Protocols
Differentially Private Protocols Computational Complexity Random Oracle
2016/1/5
We study the maximal achievable accuracy of distributed differentially private protocols for a large natural class of boolean functions, in the computational setting.
Separations in Circular Security for Arbitrary Length Key Cycles
Separations Arbitrary Length Key Cycles
2014/3/6
While standard notions of security suffice to protect any message supplied by an adversary, in some situations stronger notions of security are required. One such notion is n-circular security, where ...
An Investigation of Enhanced Target Collision Resistance Property for Hash Functions: Implications, Separations, and Domain Extension
Hash Functions Security Property eTCR
2009/11/18
In this paper we investigate the newly emerged security property called the enhanced target collision
resistance (eTCR) for hash functions. eTCR property was put forth by Halevi and Krawczyk in Crypt...
Cryptographic Hash-Function Basics:Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance,and Collision Resistance
collision resistance cryptographic hash functions preimage resistance
2009/3/23
We consider basic notions of security for cryptographic hash functions: collision resistance,
preimage resistance, and second-preimage resistance. We give seven different definitions that
correspond...
