搜索结果: 1-15 共查到“军事学 without random oracles”相关记录62条 . 查询时间(0.046 秒)
We give the first positive results about instantiability of the widely implemented and standardized RSA-OAEP encryption scheme of Bellare and Rogaway (EUROCRYPT 1994) and variants under chosen-ciphert...
Constant Size Traceable Ring Signature Scheme without Random Oracles
ring signature traceability constant size signature
2018/3/29
Currently several traceable (or linkable) identity-based ring signature schemes have been proposed. However, most of them are constructed in the random oracle model. In this paper, we present a fully ...
A New Constant-size Accountable Ring Signature Scheme Without Random Oracles
Accountable ring signatures indistinguishability obfuscation puncturable PRFs
2018/3/9
Accountable ring signature (ARS), introduced by Xu and Yung (CARDIS 2004), combines many useful properties of ring and group signatures. In particular, the signer in an ARS scheme has the flexibility ...
Efficient Sanitizable Signatures without Random Oracles
Sanitizable Signatures Random Oracles
2017/3/27
Sanitizable signatures, introduced by Ateniese et al. (ESORICS '05), allow the signer to delegate the sanitization right of signed messages. The sanitizer can modify the message and update the signatu...
Collapse-binding quantum commitments without random oracles
Quantum cryptography commitments hash functions
2016/5/26
We construct collapse-binding commitments in the standard model. Collapse-binding commitments were introduced by Unruh (Eurocrypt 2016) to model the computational-binding property of commitments again...
Identity-based Hierarchical Key-insulated Encryption without Random Oracles
public-key cryptography Key-insulated encryption Identity-based hierarchical key-insulated encryption
2016/1/26
Key-insulated encryption is one of the effective solutions to
a key exposure problem. Recently, identity-based encryption (IBE) has
been used as one of fundamental cryptographic primitives in a wide...
TOWARD CERTIFICATELESS SIGNCRYPTION SCHEME WITHOUT RANDOM ORACLES
Information Security Certificateless cryptography Signcryption
2016/1/25
Signcryption is a useful paradigm which simultaneously offers both the functions of encryption
and signature in a single logic step. It would be interesting to make signcryption certificateless
to e...
Efficient Culpably Sound NIZK Shuffle Argument without Random Oracles
Bilinear pairings CRS model mix-net
2015/12/21
One way to guarantee security against malicious voting servers is to use NIZK shuffle
arguments. Up to now, only two NIZK shuffle arguments in the CRS model have been proposed. Both
arguments are re...
Ambiguous One-Move Nominative Signature Without Random Oracles
undeniable signature non-self-authenticating signature
2014/3/6
Nominative Signature is a useful tool in situations where a signature has to be created jointly by two parties, a nominator (signer) and a nominee (user), while only the user can verify and prove to a...
A provable secure anonymous proxy signature scheme without random oracles
public-key cryptography
2014/3/7
In order to protect the proxy signers’ privacy, many anonymous proxy signature schemes which are also called proxy ring signatures, have been proposed. Although the provable security in the random ora...
Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles
attribute-based key encapsulation mechanism attribute-based encryption
2014/3/7
We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete c...
Sub-linear Blind Ring Signatures without Random Oracles
ring signatures blind ring signatures standard model
2014/3/7
Ring signatures allow a signer to anonymously sign a message on behalf of a set of arbitrarily chosen signers called a ``ring''. Blind signatures, on the other hand, allow a user to obtain a signature...
Sequential message authentication code without random oracles
Message authentication code Sequential aggregate
2014/3/11
Katz et al. provided a generic transform to construct aggregate message authentication codes and imposed a lower bound on the length of one aggregate MAC tag. The lower bound shows that the required t...
Aggregate and Verifiably Encrypted Signatures from Multilinear Maps Without Random Oracles
public-key cryptography Aggregate Signatures
2013/2/21
Aggregate signatures provide bandwidth-saving aggregation of ordinary signatures. We present the first unrestricted instantiation in the standard model, Moreover, our construction yields a multisignat...
A server-aided verification signature scheme without random oracles
public-key cryptography
2012/8/28
Server-aided verification(SAV) signature is useful for power-constrained devices since a powerful server can assist in performing costly operations such as pairing operations. Wu et al. [13] defined t...