搜索结果: 1-7 共查到“军事学 Secure protocols”相关记录7条 . 查询时间(0.078 秒)
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
Secure Computation Tamper-Proof Hardware Adaptive Security
font style='font-size:12px;'>
2017/2/20
Achieving constant-round adaptively secure protocols (where all parties can be corrupted) in the plain model is a notoriously hard problem. Very recently, three works published in TCC 2015 (Dachman-So...
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
Fairness Secure Two-Party Computation Malicious Adversaries
font style='font-size:12px;'>
2017/2/20
In a sense, a two-party protocol achieves fairness if the output from the computation is obtained simultaneously by both parties. A seminal result by Cleve (STOC 1986) states that fairness is impossib...
Composable Adaptive Secure Protocols without Setup under Polytime Assumptions
UC Security Adaptive Secure Computation Coin-Tossing
font style='font-size:12px;'>
2016/12/10
All previous constructions of general multiparty computation protocols that are secure against adaptive corruptions in the concurrent setting either require some form of setup or non-standard assumpti...
Information-Theoretically Secure Protocols and Security Under Composition
Theory of cryptography secure multiparty computation information-theoretic security
font style='font-size:12px;'>
2009/12/29
We investigate the question of whether security of protocols in the information-theoretic setting
(where the adversary is computationally unbounded) implies the security of these protocols under
con...
Constructions of Truly Practical Secure Protocols using Standard Smartcards
Truly Practical Secure Protocols Standard Smartcards
font style='font-size:12px;'>
2009/6/11
In this paper we show that using standard smartcards it is possible to construct truly prac-
tical secure protocols for a variety of tasks. Our protocols achieve full simulation-based security
in th...
On Session Identifiers in Provably Secure Protocols:The Bellare-Rogaway Three-Party Key Distribution Protocol Revisited
Secure Protocols Bellare-Rogaway Three-Party Key Protocol
font style='font-size:12px;'>
2009/4/3
We examine the role of session identifiers (SIDs) in security
proofs for key establishment protocols. After reviewing the practical importance
of SIDs we use as a case study the three-party server-b...
Concurrent Composition of Secure Protocols in the Timing Model
theory of cryptography secure multiparty computation concurrent composition timing assumptions
font style='font-size:12px;'>
2009/1/15
In the setting of secure multiparty computation, a set of mutually distrustful parties wish
to securely compute some joint function of their inputs. In the stand-alone case, it has been
shown that e...