搜索结果: 31-38 共查到“军事学 Composition”相关记录38条 . 查询时间(0.191 秒)
Cryptographic Protocol Composition via the Authentication Tests
Cryptographic Protocol Composition Authentication Tests syntactic criteria
2009/6/9
Although cryptographic protocols are typically analyzed in
isolation, they are used in combinations. If a protocol was analyzed alone
and shown to meet some security goals, will it still meet those ...
Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm
Symmetric encryption message authentication authenticated encryption concrete security
2009/4/17
An authenticated encryption scheme is a symmetric encryption scheme whose goal is to
provide both privacy and integrity. We consider two possible notions of authenticity for such
schemes, namely int...
A Composition Construction of Bent-Like Boolean Functions from Quadratic Polynomials
bent-like function bent function near-bent function
2009/4/10
In this paper, we generalize the composition construction of Khoo et al. for highly nonlinear Boolean functions ([1]). We utilize general quadratic forms instead of the trace map in the construction. ...
General Composition and Universal Composability in Secure Multiparty Computation
Universal Composability Secure Multiparty Computation
2009/4/9
Concurrent general composition relates to a setting where a secure protocol is run in a
network concurrently with other, arbitrary protocols. Clearly, security in such a setting is what is desired, o...
On the Composition of Authenticated Byzantine Agreement
Authenticated Byzantine Agreement protocol composition lower bounds
2009/3/27
A fundamental problem of distributed computing is that of simulating a secure broadcast
channel, within the setting of a point-to-point network. This problem is known as Byzantine
Agreement (or Gene...
Lower Bounds and Impossibility Results for Concurrent Self Composition
secure computation protocol composition self and general composition
2009/3/23
In the setting of concurrent self composition, a single protocol is executed many times concurrently
by a single set of parties. In this paper, we prove lower bounds and impossibility results
for se...
How To Play Almost Any Mental Game Over The Net —Concurrent Composition via Super-Polynomial Simulation
Non-malleable protocols concurrent composition multi-party secure computation
2009/1/23
We construct a secure protocol for any multi-party functionality that remains secure (under
a relaxed definition of security) when executed concurrently with multiple copies of itself and
other prot...
Concurrent Composition of Secure Protocols in the Timing Model
theory of cryptography secure multiparty computation concurrent composition timing assumptions
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...