搜索结果: 16-30 共查到“军事学 Standard Model”相关记录69条 . 查询时间(0.164 秒)
Adaptive Multiparty Non-interactive Key Exchange Without Setup In The Standard Model
adaptive security key exchange
2016/1/6
Non-interactive key exchange (NIKE) is a fundamental notion in Cryptography. This notion was introduced by Diffie and Hellman in 1976. They proposed the celebrated 2-party NIKE protocol and left open ...
Fair Multiple-bank E-cash in the Standard Model
Fair multiple-bank e-cash Automorphic blind signature Groth-Sahai proof
2016/1/5
Multiple-bank e-cash (electronic cash) model allows users and merchants to open
their accounts at different banks which are monitored by the Center Bank. Some multiple-bank
e-cash systems were propo...
One-Round Key Exchange with Strong Security: An Efficient and Generic Construction in the Standard Model
One-round key exchange eCK security provable security
2016/1/5
One-round authenticated key exchange (ORKE) is an established research area, with many prominent protocol constructions like HMQV (Krawczyk, CRYPTO 2005) and Naxos (La Macchia et al., ProvSec 2007), a...
End-to-End Verifiable Elections in the Standard Model
e-voting standard model, end-to-end verificable
2015/12/31
We present the cryptographic implementation of “DEMOS”, a new e-voting system that is endto-end
verifiable in the standard model, i.e., without any additional “setup” assumption or access
to a rando...
Practical Round-Optimal Blind Signatures in the Standard Model
Standard Model SPS-EQ One-Show Anonymous Credentials
2015/12/29
Round-optimal blind signatures are notoriously hard to construct in the standard
model, especially in the malicious-signer model, where blindness must hold under
adversarially chosen keys. This is s...
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
Group signatures standard model simple assumptions
2015/12/24
Group signatures are a central cryptographic primitive which allows users to sign messages
while hiding their identity within a crowd of group members. In the standard model (without the random
orac...
Strongly Secure One-round Group Authenticated Key Exchange in the Standard Model
cryptographic protocols
2014/3/12
One-round group authenticated key exchange (GAKE) protocols typically provide implicit authentication and appealing bind-width efficiency. As a special case of GAKE -- the pairing-based one-round trip...
Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model
public-key cryptography
2014/3/12
The extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for authenticated key exchange protocols that capture leakage of various kinds of secret information ...
On the Security of TLS-DH and TLS-RSA in the Standard Model
provable security static Diffie-Hellman
2014/3/12
TLS is the most important cryptographic protocol in the Internet. At CRYPTO 2012, Jager et al. presented the first proof of the unmodified TLS with ephemeral Diffie-Hellman key exchange (TLS-DHE) for ...
An Efficient CCA2-Secure Variant of the McEliece Cryptosystem in the Standard Model
Post-quantum cryptography McEliece cryptosystem IND-CCA2
2013/2/21
Recently, a few CCA2-secure (IND-CCA2) variant of the McEliece cryptosystem in the standard model were introduced. All these schemes are based on Rosrn-Segev approach and lossy trapdoor function and u...
Efficient Network Coding Signatures in the Standard Model
digital signatures network coding
2012/6/14
Network Coding is a routing technique where each node may actively modify the received packets before transmitting them. While this departure from passive networks improves throughput and resilience t...
Anonymous Broadcast Encryption: Adaptive Security and Efficient Constructions in the Standard Model
Efficient Constructions IND-CCA
2012/3/26
In this paper we consider \emph{anonymity} in the context of Broadcast Encryption (BE). This issue has received very little attention so far and \emph{all but one} of the currently available BE scheme...
Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model
attribute-based signatures multi-authority system non-monotone predicates
2012/6/14
This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based signature (ABS) scheme in the standard model. The security of the proposed ABS scheme is proven under st...
A non-interactive deniable authentication scheme in the standard model
public-key cryptography
2012/6/14
Deniable authentication protocols enable a sender to authenticate a message to a receiver such that the receiver is unable to prove the identity of the sender to a third party. In contrast to interact...
Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model
An extended abstract was presented at Public Key Cryptography -- PKC 2011 LNCS 6571 pages 35-52. This is the full paper.
2012/3/20
This paper presents a fully secure (adaptive-predicate unforgeable and private) attribute-based signature (ABS) scheme in the standard model. The security of the proposed ABS scheme is proven under st...