搜索结果: 1-8 共查到“军事学 completeness”相关记录8条 . 查询时间(0.062 秒)
Completeness for Symmetric Two-Party Functionalities - Revisited
studying the triviality completeness of functionalities
2016/1/26
Understanding the minimal assumptions required for carrying out cryptographic tasks is one
of the fundamental goals of theoretical cryptography. A rich body of work has been dedicated
to understandi...
A Full Characterization of Completeness for Two-party Randomized Function Evaluation
Foundations Secure 2-party Randomized Function Evaluation Completeness Characterization
2016/1/26
We settle a long standing open problem which has pursued a full characterization of completeness of
(potentially randomized) finite functions for 2-party computation that is secure against active adv...
Feasibility and Completeness of Cryptographic Tasks in the Quantum World
cryptographic reductions quantum security
2015/12/31
It is known that cryptographic feasibility results can change
by moving from the classical to the quantum world. With this in mind, we
study the feasibility of realizing functionalities in the frame...
Completeness Theorems for All Finite Stateless 2-Party Primitives
oblivious transfer complete primitives information-theoretic security universal composability secure function
2013/4/18
Since Kilian showed in 1988 that oblivious transfer (OT) is complete in the sense that every secure multi-party computation can be realized from this primitive, cryptographers are working on reduction...
Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions
oblivious transfer complete primitives information-theoretic security universal composability secure function evaluation
2011/1/5
In this paper we present simple but comprehensive combinatorial criteria for completeness of finite deterministic 2-party functions with respect to information-theoretic security. We give a general pr...
Key-Dependent Message Security: Generic Amplification and Completeness Theorems
Key-dependent message cyclic-security randomized encoding
2010/10/11
In this work, we prove the first \emph{generic} KDM amplification theorem which relies solely on the KDM security of the underlying scheme without making any other assumptions. Specifically, we show t...
SOUNDNESS AND COMPLETENESS OF FORMAL LOGICS OF SYMMETRIC ENCRYPTION
Software Quality Infrastructure Protection Diffuse Computing
2009/1/22
I would like to thank Andre Scedrov for his tremendous support as a thesis advisor, and also for introducing me to the subject and to the information security and cryptography community. I
would also...
We study an extension of the well-known Abadi-Rogaway
logic with hashes. Previously, we have given a sound computational in-
terpretation of this extension using Canetti's oracle hashing. This paper...