Results 31 to 40 of about 9,626 (278)
A group signature allows a group member who signs the message on behalf of the other group members. Any recipient also verifies the signature without knowing the signer.
Meryem Soysaldı Şahin, Sedat Akleylek
doaj +1 more source
DAGS: Key encapsulation using dyadic GS codes
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
The Random Oracle Methodology, Revisited [PDF]
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions& ...
Ran Canetti +5 more
core +1 more source
Provably Secure Covert Communication on Blockchain
Blockchain is a public open ledger that provides data integrity in a distributed manner. It is the underlying technology of cryptocurrencies and an increasing number of related applications, such as smart contracts. The open nature of blockchain together
Juha Partala
doaj +1 more source
Blockchain Certificateless Encryption Mechanism Based on National Secret Algorithm [PDF]
The blockchain has attracted widespread attention because of its distributed,non-tamperable and inherent immutability features.However,the international cryptographic algorithm used in the blockchain has certain backdoor security risks.Based on the ...
XIANG Yanjie, HUANG Xiaofang, XIANG Kefeng, ZHENG Ji’nan
doaj +1 more source
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [PDF]
Copy-protection allows a software distributor to encode a program in such a way that it can be evaluated on any input, yet it cannot be "pirated" – a notion that is impossible to achieve in a classical setting.
Andrea Coladangelo +2 more
doaj +1 more source
Universally Composable Sigma-protocols in the Global Random-Oracle Model [PDF]
Numerous cryptographic applications require efficient non-interactive zero-knowledge proofs of knowledge (NIZKPoK) as a building block. Typically they rely on the Fiat-Shamir heuristic to do so, as security in the random-oracle model is considered good ...
Anna Lysyanskaya, Leah Namisa Rosenbloom
core
Committing to information is a central task in cryptography, where a party (typically called a prover) stores a piece of information (e.g., a bit string) with the promise of not changing it.
Lijie Chen, Ramis Movassagh
doaj +1 more source
The Random Oracle Model and the Ideal Cipher Model Are Equivalent [PDF]
The Random Oracle Model and the Ideal Cipher Model are two well known idealised models of computation for proving the security of cryptosystems. At Crypto 2005, Coron et al.showed that security in the random oracle model implies security in the ideal cipher model; namely they showed that a random oracle can be replaced by a block cipher-based ...
CORON, Jean-Sébastien +2 more
openaire +3 more sources
Attacks on One Designated Verifier Proxy Signature Scheme
In a designated verifier proxy signature scheme, there are three participants, namely, the original signer, the proxy signer, and the designated verifier.
Baoyuan Kang
doaj +1 more source

