Results 21 to 30 of about 11,478 (298)
Identity-Based Partially Blind Signature Scheme: Cryptanalysis and Construction
IEEE Access, 2021 Blind signature is a special type of digital signature, the signer cannot see the specific content signed. However, blindness may cause users to abuse their rights.
Yuhong Jiang, Lunzhi Deng, Bingqin Ning
doaj +1 more source
Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test
IEEE Access, 2021 Public key encryption with equality test (PKEET for short) is a new cryptographic primitive which allows a proxy to check whether two ciphertexts encrypted under different public keys are of the same plaintext.
Zhi-Yan Zhao, Peng Zeng
doaj +1 more source
Correcting Subverted Random Oracles
CoRR, 2021 The random oracle methodology has proven to be a powerful tool for designing and reasoning about cryptographic schemes. In this paper, we focus on the basic problem of correcting faulty or adversarially corrupted random oracles, so that they can be confidently applied for such cryptographic purposes. We prove that a simple construction can transform a
Alexander Russell +4 more
openaire +3 more sources
Sequential Hashing with Minimum Padding
Cryptography, 2018 This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property.
Shoichi Hirose
doaj +1 more source
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009 This work focuses on a vulnerability of hash functions due to sloppy usages or implementations in the real world. If our cryptographic research community succeeded in the development of a perfectly secure random function as the random oracle, it might be broken in some sense by invalid uses.
YONEYAMA, Kazuki +2 more
openaire +1 more source
Streebog as a Random Oracle [PDF]
, 2023 The random oracle model is an instrument used for proving that protocol has no structural flaws when settling with standard hash properties is impossible or fairly difficult. In practice, however, random oracles have to be instantiated with some specific
Alexandra Babueva +2 more
core
Combiners for Backdoored Random Oracles [PDF]
, 2018 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 functions of its table via backdoor capabilities. This model captures intentional (and unintentional) weaknesses due to the existence of collision-finding or ...
Balthazar Bauer +2 more
openaire +3 more sources
Non Observability in the Random Oracle Model [PDF]
, 2012 The Random Oracle Model, introduced by Bellare and Rogaway, provides a method to heuristically argue about the security of cryptographic primitives and protocols.
Prabhanjan Ananth, Raghav Bhaskar
core +1 more source
Limits of random oracles in secure computation [PDF]
Proceedings of the 5th conference on Innovations in theoretical computer science, 2014 The seminal result of Impagliazzo and Rudich (STOC 1989) gave a black-box separation between one-way functions and public-key encryption: informally, a public-key encryption scheme cannot be constructed using one-way functions as the sole source of computational hardness.
Mohammad Mahmoody +2 more
openaire +3 more sources
DAGS: Key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology, 2018 Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo +12 more
doaj +1 more source