搜索结果: 1-15 共查到“密码学 random oracles”相关记录79条 . 查询时间(0.084 秒)
Uncloneable Quantum Encryption via Random Oracles
Quantum Cryptography Encryption Uncloneability
2019/3/1
Quantum information is well-known to achieve cryptographic feats that are unattainable using classical information alone. Here, we add to this repertoire by introducing a new cryptographic functionali...
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...
Combiners for Backdoored Random Oracles
random oracle combiner communication complexity set- disjointness
2018/8/28
We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) model, whereby a big brother designs a "good" hash function, but can also see arbitrary functi...
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 ...
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation
point obfuscation non-malleability virtual black-box
2018/3/7
The random oracle paradigm allows us to analyze the security of protocols and construction in an idealized model, where all parties have access to a truly random function. This is one of the most succ...
The Wonderful World of Global Random Oracles
random oracle model universal composability global random oracle
2018/3/6
The random-oracle model by Bellare and Rogaway (CCS'93) is an indispensable tool for the security analysis of practical cryptographic protocols. However, the traditional random-oracle model fails to g...
We revisit security proofs for various cryptographic primitives in the auxiliary-input random-oracle model (AI-ROM), in which an attacker AA can compute arbitrary SS bits of leakage about the random o...
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...
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles
functional encryption simulation-based security random oracle model
2016/12/8
In this work we study the feasibility of achieving simulation security in functional encryption (FE) in the
random oracle model. Our main result is negative in that we give a functionality for which ...
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...
In recent work, Bellare, Hoang, and Keelveedhi (CRYPTO 2013) introduced a new abstraction called Universal Computational Extractors (UCEs), and showed how they can replace random oracles (ROs) across ...
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...
Fully secure constrained pseudorandom functions using random oracles
constrained pseudorandom functions adaptive security non-interactive key exchange
2016/1/9
A constrained pseudorandom function (CPRF) PRF allows to derive constrained evaluation
keys that only allow to evaluate PRF on a subset of inputs. CPRFs have only recently been
introduced independen...