Results 11 to 20 of about 26,946 (315)
Provably Secure Steganography [PDF]
IEEE Transactions on Computers, 2002 Informally, steganography is the process of sending a secret message from Alice to Bob in such a way that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In this work, we initiate the study of steganography from a complexity-theoretic point of view.
Nicholas Hopper +2 more
openaire +3 more sources
Provable Security of SP Networks with Partial Non-Linear Layers
IACR Transactions on Symmetric Cryptology, 2021 Motivated by the recent trend towards low multiplicative complexity blockciphers (e.g., Zorro, CHES 2013; LowMC, EUROCRYPT 2015; HADES, EUROCRYPT 2020; MALICIOUS, CRYPTO 2020), we study their underlying structure partial SPNs, i.e., Substitution ...
Chun Guo +4 more
doaj +1 more source
Provable Secure Parallel Gadgets
IACR Transactions on Cryptographic Hardware and Embedded Systems, 2023 Side-channel attacks are a fundamental threat to the security of cryptographic implementations. One of the most prominent countermeasures against side-channel attacks is masking, where each intermediate value of the computation is secret shared, thereby concealing the computation’s sensitive information.
Francesco Berti +2 more
openaire +2 more sources
Provably secure social network privacy-preserving scheme
网络与信息安全学报, 2016 A provable secure social network privacy-preserving scheme was proposed to solve the problem of social network privacy-preserving scheme's security proof.Firstly,through analyzing the security requirements about the node's privacy (indistinguishable node
Jian-qiong HE,You-liang TIAN, Kai ZHOU
doaj +3 more sources
Beyond-Birthday-Bound Security for 4-round Linear Substitution-Permutation Networks
IACR Transactions on Symmetric Cryptology, 2020 Recent works of Cogliati et al. (CRYPTO 2018) have initiated provable treatments of Substitution-Permutation Networks (SPNs), one of the most popular approach to construct modern blockciphers.
Yuan Gao +4 more
doaj +1 more source
Public Key Encryption Supporting Plaintext Equality Test and User-Specified Authorization [PDF]
, 2011 In this paper we investigate a category of public key encryption schemes which supports plaintext equality test and user-specified authorization. With this new primitive, two users, who possess their own public/private key pairs, can issue token(s) to a ...
Tang, Qiang
core +9 more sources
On one Block Cipher Mode of Operation Used to Protect Data on Block-Oriented Storage Devices
Современные информационные технологии и IT-образование, 2022 This research purpose is to develop a reduction-based method for analysis of cryptographic properties of block cipher modes of operation in context of full disk encryption (FDE) via provable security technique, to study weaknesses of widely spread among ...
Georgii Firsov, Alisa Koreneva
doaj +1 more source
Provably Secure Generative Linguistic Steganography [PDF]
Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021, 2021 Accepted by ACL-IJCNLP 2021 ...
Zhongliang Yang +3 more
openaire +3 more sources
Provably Secure Encryption Schemes With Zero Setup and Linear Speed by Using Rubik’s Cubes
IEEE Access, 2020 Recently, new paradigms for designing modern cryptographic schemes were proposed based on Rubik's rotations. However, most of them lack rigorous provable security reductions.
Ping Pan +3 more
doaj +1 more source
Provably Quantum-Secure Tweakable Block Ciphers
IACR Transactions on Symmetric Cryptology, 2021 Recent results on quantum cryptanalysis show that some symmetric key schemes can be broken in polynomial time even if they are proven to be secure in the classical setting.
Akinori Hosoyamada, Tetsu Iwata
doaj +1 more source