Results 11 to 20 of about 16,532 (241)
General Impossibility of Group Homomorphic Encryption in the Quantum World [PDF]
, 2014 Group homomorphic encryption represents one of the most important building blocks in modern cryptography. It forms the basis of widely-used, more sophisticated primitives, such as CCA2-secure encryption or secure multiparty computation.
Armknecht, Frederik +3 more
core +17 more sources
Exploiting Decryption Failures in Mersenne Number Cryptosystems
Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography, 2020 Mersenne number schemes are a new strain of potentially quantum-safe cryptosystems that use sparse integer arithmetic modulo a Mersenne prime to encrypt messages. Two Mersenne number based schemes were submitted to the NIST post-quantum standardization process: Ramstake and Mersenne-756839.
D'Anvers, Jan-Pieter, Tiepelt, Marcel
openaire +2 more sources
Failing Gracefully: Decryption Failures and the Fujisaki-Okamoto Transform
, 2022 52 pages, 17 ...
Hövelmanns, Kathrin +2 more
openaire +2 more sources
Blockchain-Based Multiple Authorities Attribute-Based Encryption for EHR Access Control Scheme
Applied Sciences, 2022 The Internet of Medical Things (IOMT) is critical in improving electronic device precision, dependability, and productivity. Researchers are driving the development of digital healthcare systems by connecting available medical resources and healthcare ...
Xiaohui Yang, Chenshuo Zhang
doaj +1 more source
Ciphertext policy hidden access control scheme based on blockchain and supporting data sharing
Tongxin xuebao, 2022 Objectives: Although the traditional attribute-based encryption scheme achieves one-to-many access control,there are still challenges such as single point of failure,low efficiency,no support for data sharing,and privacy leakage.To solve these problems,a
Ruizhong DU, Tianhe ZHANG, Pengliang SHI
doaj +2 more sources
Enhanced NTRU cryptosystem eliminating decryption failures
Journal of Systems Engineering and Electronics, 2006 Summary: An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model and chosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reduction algorithms are analyzed to evaluate the security of this scheme.
Yao, Jun, Zeng, Guihua
openaire +1 more source
Analysis of common attacks in LDPCC-based public-key cryptosystems [PDF]
, 2003 We analyze the security and reliability of a recently proposed class of public-key cryptosystems against attacks by unauthorized parties who have acquired partial knowledge of one or more of the private key components and/or of the plaintext.
D. Saad +17 more
core +2 more sources
On Symmetric Encryption with Distinguishable Decryption Failures [PDF]
, 2014 We propose to relax the assumption that decryption failures are indistinguishable in security models for symmetric encryption. Our main purpose is to build models that better reflect the reality of cryptographic implementations, and to surface the security issues that arise from doing so.
Boldyreva, Alexandra +3 more
openaire +2 more sources
Моделирование и анализ информационных систем, 2023 The development of fast algorithms for key generation, encryption and decryption not only increases the efficiency of related operations. Such fast algorithms, for example, for asymmetric cryptosystems on quasi-cyclic codes, make it possible to ...
Andrey N. Sushko +4 more
doaj +1 more source
Rogue Decryption Failures: Reconciling AE Robustness Notions [PDF]
, 2015 An authenticated encryption scheme is deemed secure AE if ciphertexts both look like random bitstrings and are unforgeable. AE is a much stronger notion than the traditional IND---CCA. One shortcoming of AE as commonly understood is its idealized, all-or-nothing decryption: if decryption fails, it will always provide the same single error message and ...
Barwell, Guy +2 more
openaire +2 more sources