搜索结果: 31-45 共查到“军事学 commitments”相关记录49条 . 查询时间(0.059 秒)
In 2009, Abdalla et al. proposed a reasonably practical password-authenticated key exchange (PAKE) secure against adaptive adversaries in the universal composability (UC) framework. It exploited the C...
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
secure two-party computation cut-and-choose
2014/3/10
A Secure Two Party Computation (S2PC) protocol allows two parties to compute over their combined private inputs, as if intermediated by a trusted third party. In the active model, security is maintain...
Unconditionally Secure and Universally Composable Commitments from Physical Assumptions
UC hardware assumptions unconditional security commitment scheme
2013/4/18
We present a constant-round unconditional black-box compiler, that transforms any ideal straight- line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yie...
Vector Commitments and their Applications
Vector Commitments Commitments Accumulator Zero-Knowledge Databases Verifiable Databases
2012/3/26
We introduce a new primitive that we call {\em Vector Commitment} (VC, for short). Informally, VCs allow to commit to an ordered sequence of $q$ values $(m_1, \ldots, m_q)$ (i.e., a vector) in such a ...
CommitCoin: Carbon Dating Commitments with Bitcoin
electronic commerce payment bit commitment
2012/6/14
In the standard definition of a commitment scheme, the sender commits to a message and immediately sends the commitment to the recipient interested in it. However the sender may not always know at the...
CommitCoin:Carbon Dating Commitments with Bitcoin
applications / electronic commerce and payment bit commitment
2012/3/20
In the standard definition of a commitment scheme, the sender commits to a message and immediately sends the commitment to the recipient interested in it. However the sender may not always know at the...
CommitCoin: Carbon Dating Commitments with Bitcoin
applications / electronic commerce and payment bit commitment
2012/8/28
In the standard definition of a commitment scheme, the sender commits to a message and immediately sends the commitment to the recipient interested in it. However the sender may not always know at the...
Highly-Efficient Universally-Composable Commitments based on the DDH Assumption
cryptographic protocols / universal composability commitment schemes concrete efficiency
2012/3/28
Universal composability (or UC security) provides very strong security guarantees for protocols that run in complex real-world environments. In particular, security is guaranteed to hold when the prot...
Constant-round Non-Malleable Commitments from Any One-Way Function
Non-Malleability Constant-round One-Way Function
2010/9/14
We show \emph{unconditionally} that the existence of commitment schemes implies the existence of \emph{constant-round} non-malleable commitments; earlier protocols required additional assumptions such...
(Nearly) optimal black-box constructions of commitments secure against selective opening attacks
commitments black-box lower bounds zero knowledge
2009/11/18
Selective opening attacks against commitment schemes occur when the commitment
scheme is repeated in parallel (or concurrently) and an adversary can choose depending on
the commit-phase transcript t...
Homomorphic Trapdoor Commitments to Group Elements
Homomorphic trapdoor commitment bilinear groups simultaneous triple pairing assumption
2009/6/11
We present a homomorphic trapdoor commitment to group elements. In contrast, previous
homomorphic trapdoor commitment schemes only allow the messages to be exponents. Our commitment
scheme is length...
On the Composability of Statistically Secure Bit Commitments
Composability Statistically Secure Bit Commitments
2009/6/9
We show that stand-alone statistically secure commitments based on two-party stateless
primitives are statistically universally composable. I.e. they are simulatable secure with an
unlimited adversa...
Constant-Round Concurrent Non-Malleable Commitments and Decommitments
commitments definitions non-malleability
2009/6/5
In this paper we consider commitment schemes that are secure against concurrent
poly-time man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions
of security for commitment scheme...
David and Goliath Commitments:UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
UC Computation Asymmetric Parties Tamper-Proof Hardware
2009/6/2
Designing secure protocols in the Universal Composability (UC) framework confers many
advantages. In particular, it allows the protocols to be securely used as building blocks in more
complex protoc...
Universally Composable Commitments
Commitment schemes concurrent composition non-malleability
2009/4/16
We propose a new security measure for commitment protocols, called Universally Composable
(UC) Commitment. The measure guarantees that commitment protocols behave like an \ideal
commitment service,"...