Results 11 to 20 of about 3,510 (286)
Symmetric Blind Decryption with Perfect Secrecy [PDF]
Journal of Computer Networks and Communications, 2017 A blind decryption scheme enables a user to query decryptions from a decryption server without revealing information about the plain-text message. Such schemes are useful, for example, for the implementation of privacy-preserving encrypted file storages ...
Juha Partala
doaj +5 more sources
Robust Secure Authentication and Data Storage with Perfect Secrecy
Cryptography, 2018 We consider an authentication process that makes use of biometric data or the output of a physical unclonable function (PUF), respectively, from an information theoretical point of view.
Sebastian Baur, Holger Boche
doaj +4 more sources
Introducing Perfect Forward Secrecy for AN.ON [PDF]
Lecture Notes in Computer Science, 2010 In this paper we discuss AN.ON's need to provide perfect forward secrecy and show by an estimation of the channel build up time that the straight forward solution is not a practical solution. In the remaining paper we propose an improvement which enables AN.ON to provide perfect forward secrecy with respect to their current attacker model.
Dogan Kesdogan
exaly +3 more sources
ADDING PERFECT FORWARD SECRECY TO KERBEROS
Journal of Engineering, 2010 Kerberos system is a powerful and widely implemented authentication system. Despite this fact it has several problems such as the vulnerability to dictionary attacks which is solved with the use of public key cryptography.
Wameedh Nazar Flayyih
doaj +4 more sources
From perfect secrecy to perfect safety & security: Cryptography-based analysis of endogenous security [PDF]
Security and Safety, 2023 In this paper, we propose a conjecture that endogenous security without any prior knowledge is similar to perfect secrecy without any prior knowledge.
Jin Liang, Hu Xiaoyan, Wu Jiangxing
doaj +3 more sources
Error-Free Perfect Secrecy Systems
2011 IEEE International Symposium on Information Theory Proceedings, 2011 Shannon's fundamental bound for perfect secrecy says that the entropy of the secret message cannot be larger than the entropy of the secret key initially shared by the sender and the legitimate receiver. Massey gave an information theoretic proof of this result, however this proof does not require independence of the key and ciphertext.
Siu-Wai Ho +3 more
openaire +4 more sources
Towards Foundations of Cryptography: Investigation of Perfect Secrecy
J. Univers. Comput. Sci., 1996 JUCS - Journal of Universal Computer Science Volume Nr.
Jürgensen,H., Robbins,L.
openaire +5 more sources
Sensors, 2017 Due to their frequent use in unattended and hostile deployment environments, the security in wireless sensor networks (WSNs) has attracted much interest in the past two decades.
Ling Xiong +4 more
doaj +2 more sources
Perfect secrecy via compressed sensing [PDF]
2013 Iran Workshop on Communication and Information Theory, 2013 In this paper we consider the compressive sensing based encryption and proposed the conditions in which the perfect secrecy is achievable. We prove that when the measurement matrix holds the Restricted Isometry Property (RIP) and the number of measurements is more than two times of the sparsity level, i.e., M ≥ 2k, the Shannon perfect secrecy condition
Babak Seyfe, Hamid G Bafghi
exaly +2 more sources
XOR Chain and Perfect Secrecy at the Dawn of the Quantum Era
Cryptography, 2023 In this article, we present a new method that achieves Shannon’s perfect secrecy. To achieve this property, we will introduce the triple XOR cancellation rule. The approach has two execution modes: digital signature and data encryption.
Luis Adrián Lizama-Pérez
doaj +2 more sources