Academic literature on the topic 'Secret-key cryptography'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Secret-key cryptography.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Secret-key cryptography"

1

Liu, Shuiyin, Yi Hong, and Emanuele Viterbo. "Unshared Secret Key Cryptography." IEEE Transactions on Wireless Communications 13, no. 12 (2014): 6670–83. http://dx.doi.org/10.1109/twc.2014.2364022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Girija, Rani Suthoju, and Suresh babu M. "Cryptographic Services to Enforce Secure Messaging and Data Storage." International Journal of Innovative Science and Research Technology 7, no. 11 (2022): 1693–96. https://doi.org/10.5281/zenodo.7478875.

Full text
Abstract:
In secret key cryptography, a single key is used for both encryption and decryption. It achieves privacy and confidentiality. In this, sender sends the cipher text by encrypting the plain text with a secret key and receiver decrypts the cipher text by using same secret key to generate original plain text. The secret key must be shared between two authorized users secretly to apply at both the ends for encrypting and decrypting. Major challenge of secret key cryptography is the key sharing i.e., distribution of secret key to the sender and the receiver. This paper discusses the symmetric key cr
APA, Harvard, Vancouver, ISO, and other styles
3

NAGY, NAYA, MARIUS NAGY, and SELIM G. AKL. "KEY DISTRIBUTION VERSUS KEY ENHANCEMENT IN QUANTUM CRYPTOGRAPHY." Parallel Processing Letters 20, no. 03 (2010): 239–50. http://dx.doi.org/10.1142/s0129626410000193.

Full text
Abstract:
It has been said that quantum cryptography in general offers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum protocols to establish a new large secret key. This large secret key can be arbitrarily long and is unbreakable. Thus, to date, the main contribution of quantum cryptography has been believed to be quantum key enhancement. This paper shows that quantum cryptography can do significantly more. The quantum protocol described here distributes an unbreakable secret key to the two parties by relying on publ
APA, Harvard, Vancouver, ISO, and other styles
4

Joye, Marc, and Sung-Ming Yen. "ID-based secret-key cryptography." ACM SIGOPS Operating Systems Review 32, no. 4 (1998): 33–39. http://dx.doi.org/10.1145/302350.302359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kak, S. C. "Secret-hardware public-key cryptography." IEE Proceedings E Computers and Digital Techniques 133, no. 2 (1986): 94. http://dx.doi.org/10.1049/ip-e.1986.0010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Septafiansyah, Dwi Putra, Yudhiprawira Mario, Sutikno Sarwono, Kurniawan Yusuf, and Suwandi Ahmad Adang. "Power analysis attack against encryption devices: a comprehensive analysis of AES, DES, and BC3." TELKOMNIKA Telecommunication, Computing, Electronics and Control 17, no. 3 (2019): 1282–89. https://doi.org/10.12928/TELKOMNIKA.v17i3.9384.

Full text
Abstract:
Cryptography is a science of creating a secret message and it is constantly developed. The development consists of attacking and defending the cryptography itself. Power analysis is one of many Side-Channel Analysis (SCA) attack techniques. Power analysis is an attacking technique that uses the information of a cryptographic hardware’s power consumption. Power analysis is carried on by utilizing side-channel information to a vulnerability in a cryptographic algorithm. Power analysis also uses a mathematical model to recover the secret key of the cryptographic device. This research uses d
APA, Harvard, Vancouver, ISO, and other styles
7

Makeri, Yakubu Ajiji. "INTEGRATED CRYPTOGRAPHICAL ACCESS CONTROL OVER NETWORK PROJECT." Acta Informatica Malaysia 4, no. 1 (2020): 19–21. http://dx.doi.org/10.26480/aim.01.2020.19.21.

Full text
Abstract:
Cryptanalysis is a new ID-based encryption scheme proposed by Meshram. I found a method for factor N, where N is the parameter proposed by Meshram. We also provide a method for retrieving the Secret Master key for Mayshram’s ID-based encryption scheme. Identity-based (ID-based) cryptography is very useful because it simplifies certificate management in public-key cryptocurrency. For the design of the Integrated File Level Cryptographic Access Control (IFLCAC) system, it makes file security much easier for the end-user. This system combines the advantages of traditional file-level cryptography
APA, Harvard, Vancouver, ISO, and other styles
8

Pallavi, Vijay Chavan, Mohammad Atique Dr., and Latesh Malik Dr. "Design and Implementation of Hierarchical Visual Cryptography with Expansionless Shares." International Journal of Network Security & Its Applications (IJNSA) 6, no. 1 (2014): 91–102. https://doi.org/10.5281/zenodo.6471758.

Full text
Abstract:
Novel idea of hierarchical visual cryptography is stated in this paper. The key concept of hierarchical visual cryptography is based upon visual cryptography. Visual cryptography encrypts secret information into two pieces called as shares. These two shares are stacked together by logical XOR operation to reveal the original secret. Hierarchical visual cryptography encrypts the secret in various levels. The encryption in turn is expansionless. The original secret size is retained in the shares at all levels. In this paper secret is encrypted at two different levels. Four shares are generated o
APA, Harvard, Vancouver, ISO, and other styles
9

Sagala, Sarah. "Application of Diffie-Hellman Algorithm Method (Key-Exchange) in Cryptography." Login : Jurnal Teknologi Komputer 18, no. 02 (2024): 114–19. https://doi.org/10.58471/login.v18i02.114.

Full text
Abstract:
In cryptography, key exchange security is essential. Because the message code can only be a message that is analyzed with a key offer that matches this message. Secret messages can be delivered through symmetric cryptographic algorithms with coded keys or with key exchange algorithms. One of the key exchange methods that has been developed is Diffie-Hellman Key-Exchange (DHKE). Diffie-Hellman is a simple method used to generate a key between two parties in order to communicate securely. The two parties running this algorithm have their own secret variables, by exchanging two public variable va
APA, Harvard, Vancouver, ISO, and other styles
10

Dubey, Praveer, and Ompal Yadav. "A Survey on Quantum cryptography versus classical Cryptography." International Journal of Current Engineering and Technology 10, no. 06 (2021): 910–13. http://dx.doi.org/10.14741/ijcet/v.10.6.3.

Full text
Abstract:
Quantum Cryptography is an approach to securing communications by applying the phenomena of quantum physics. Unlike traditional classical cryptography, which uses mathematical techniques to restrict eavesdroppers, quantum cryptography is focused on the physics of information. The development of quantum cryptography was motivated by the short-comings of classical cryptographic methods, which can be classified as either public-key or secret-key Methods. There are classical solutions to insecure communication all rely on making some or assumption, about the computational power of a cheater, about
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Secret-key cryptography"

1

Fokin, Dennis. "A secure multi-party scheme with certificateless cryptography for secret key extraction." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231574.

Full text
Abstract:
Many systems contain sensitive data such as user credentials used for authentication purposes. For large systems, a common approach is to store the data in a configuration file at a trusted third party. However, that would imply a single point of failure if an adversary gains access to the trusted party. In theory this could be solved by encrypting the data but in practice this only moves the problem and does not solve it, since some type of credential data is needed to decrypt the configuration file. A more flexible solution is needed that requires less of human interaction while also providi
APA, Harvard, Vancouver, ISO, and other styles
2

Quist, Britton T. "Improved Channel Probing for Secret Key Generation with Multiple Antenna Systems." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3554.

Full text
Abstract:
Establishing secret keys from the commonly-observed randomness of reciprocal wireless propagation channels has recently received considerable attention. In this work we propose improved strategies for channel estimation between MIMO or beamforming systems for secret key generation. The amount of mutual information that can be extracted from the channel matrix estimates is determined by the quality of channel matrix estimates. By allocating increased energy to channel estimation for higher gain beamforming combinations at the expense of low-gain combinations, key establishment performance can b
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Chan. "Secret Key Establishment Using Wireless Channels as Common Randomness in Time-Variant MIMO Systems." Diss., CLICK HERE for online access, 2010. http://contentdm.lib.byu.edu/ETD/image/etd3532.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Olsson, Fredrik. "A Lab System for Secret Sharing." Thesis, Linköping University, Department of Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2385.

Full text
Abstract:
<p>Finnegan Lab System is a graphical computer program for learning how secret sharing works. With its focus on the algorithms and the data streams, the user does not have to consider machine-specific low-level details. It is highly modularised and is not restricted to secret sharing, but can easily be extended with new functions, such as building blocks for Feistel networks or signal processing. </p><p>This thesis describes what secret sharing is, the development of a new lab system designed for secret sharing and how it can be used.</p>
APA, Harvard, Vancouver, ISO, and other styles
5

Tu, Zhiqi. "Enhancements of the Non-linear Knapsack Cryptosystem." Thesis, University of Canterbury. Computer Science and Software Engineering, 2006. http://hdl.handle.net/10092/1080.

Full text
Abstract:
Nowadays all existing public key cryptosystems are classified into three categories relied on different mathematical foundations. The first one is based on the difficulty of factoring the product of two big prime numbers. The representatives are the RSA and the Rabin cryptosystems. The second one such as the ElGamal cryptosystem is based on the discrete logarithm problem. The last one is based on the NP-completeness of the knapsack problem. The first two categories survived crypto attacks, whereas the last one was broken and there has been no attempt to use such a cryptosystem. In order t
APA, Harvard, Vancouver, ISO, and other styles
6

Valkaitis, Mindaugas. "Efektyvios šifravimo bei skaitmeninio parašo sistemos." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2012~D_20140704_171717-30545.

Full text
Abstract:
Šio darbo tikslas – apžvelgti šiuo metu naudojamas klasikines viešojo rakto šifravimo ir skaitmeninio parašo sistemas bei naujos kartos Signcryption kriptosistemą ir atlikti dedikuotos pasirašymo ir šifravimo kriptosistemos efektyvumo palyginimą su pasirašymo arba šifravimo kriptosistemų kompozicija bei pasiūlyti praktinio pritaikymą naujos kartos Signcryption kriptosistemai. Darbe apžvelgtos šios kriptosistemos: 1. RSA (Rivest, Shamir, Adleman) – klasikinė viešojo rakto pasirašymo arba šifravimo kriptosistema, kurios saugumas paremtas didelių skaičių faktorizacijos uždavinio sprendimo sudėtin
APA, Harvard, Vancouver, ISO, and other styles
7

Wen, Wen. "Energy Efficient Secure Key Management Schemes for WSNs and IoT." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35257.

Full text
Abstract:
Secret sharing is critical to most applications making use of security and remains one of the most challenging research areas in modern cryptography. In this thesis, we propose a novel efficient multi-secret sharing scheme based on the Chinese remainder theorem (CRT) with two verification methods, while the previous works are mostly based on the Lagrange polynomial. Key management schemes play an important role in communication security in Wireless Sensor Networks (WSNs). While the previous works mainly targeting on two different types of WSNs: distributed and hieratical, in this thesis, we
APA, Harvard, Vancouver, ISO, and other styles
8

Frixons, Paul. "Cryptographie à clé secrète et attaquant quantique dans le monde des télécommunications." Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS339.

Full text
Abstract:
Pour la cryptographie moderne, la sécurité d'un système est définie comme la somme des ressources nécessaires pour le briser. Avec la venue d'ordinateurs quantiques efficaces et les nouvelles possibilités algorithmiques que cela ouvre, ce montant de ressources est voué à changer. Dans cette thèse, nous effectuons un pas en direction d'une meilleure compréhension de cette menace quantique. Après une introduction au calcul quantique et à la cryptographie, nous montrons des attaques quantiques contre la fonction pseudo-aléatoire de Legendre sans requête en superposition et en mémoire quantique ré
APA, Harvard, Vancouver, ISO, and other styles
9

Azfar, Abdullah. "Multiple Escrow Agents in VoIP." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-10895.

Full text
Abstract:
Using a Key escrow agent in conjunction with Voice over IP (VoIP) communication ensures that law enforcements agencies (LEAs) can retrieve the session key used to encrypt data between two users in a VoIP session. However, the use of a single escrow agent has some drawbacks. A fraudulent request by an evil employee from the LEA can lead to improper disclosure of a session key. After the escrow agent reveals the key this evil person could fabricate data according to his/her needs and encrypt it again (using the correct session key). In this situation the persons involved in the communication ses
APA, Harvard, Vancouver, ISO, and other styles
10

Riahinia, Mahshid. "Constrained Pseudorandom Functions : New Constructions and Connections with Secure Computation." Electronic Thesis or Diss., Lyon, École normale supérieure, 2024. http://www.theses.fr/2024ENSL0022.

Full text
Abstract:
Les fonctions pseudo-aléatoires (Pseudorandom Functions, alias PRFs) ont été introduites en 1986, par Goldreich, Goldwasser et Micali, comme moyen efficace de générer de l’aléa et servent depuis d’outils essentiels en cryptographie. Ces fonctions utilisent une clé secrète principale pour faire correspondre différentes entrées à des sorties pseudo-aléatoires. Les fonctions pseudo-aléatoires contraintes (Constrained Pseudorandom Functions, alias CPRFs), introduites en 2013, étendent les PRFs enautorisant la délégation des clés contraintes qui permettent l’évaluation de la fonction uniquement sur
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Secret-key cryptography"

1

Warner, Penny. The secret of the skeleton key. Egmont USA, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Galbreath, Nick. Cryptography for Internet and database applications: Developing secret and public key techniques with Java. Wiley Pub., 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

1943-, Spector Ronald H., ed. Listening to the enemy: Key documents on the role of communications intelligence in the war with Japan. Scholarly Resources Inc., 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Assche, Gilles Van. Quantum Cryptography and Secret-Key Distillation. Cambridge University Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Assche, Gilles Van. Quantum Cryptography and Secret-Key Distillation. Cambridge University Press, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Assche, Gilles Van. Quantum Cryptography and Secret-Key Distillation. University of Cambridge ESOL Examinations, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Assche, Gilles Van. Quantum Cryptography and Secret-Key Distillation. Cambridge University Press, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

QUANTUM CRYPTOGRAPHY AND SECRET-KEY DISTILLATION. CAMBRIDGE UNIV PRESS, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Rubin, Frank. Secret Key Cryptography: Ciphers, from Simple to Unbreakable. Manning Publications Co. LLC, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Secret Key Cryptography: Ciphers, from Simple to Unbreakable. Manning Publications Co. LLC, 2022.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Secret-key cryptography"

1

Buchanan, William J. "Secret Key Encryption." In Cryptography. River Publishers, 2022. http://dx.doi.org/10.1201/9781003337751-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Song Y. "Secret-Key Cryptography." In Cybercryptography: Applicable Cryptography for Cyberspace Security. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-72536-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hoepman, Jaap-Henk. "Secret Key Authentication with Software-Only Verification." In Financial Cryptography. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45472-1_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tilburg, Johan. "Secret-key exchange with authentication." In Computer Security and Industrial Cryptography. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57341-0_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Fafoutis, Xenofon, and Letizia Marchegiani. "Secret Key Generation in Sensor Networks." In Encyclopedia of Cryptography, Security and Privacy. Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-642-27739-9_1796-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fafoutis, Xenofon, and Letizia Marchegiani. "Secret Key Generation in Sensor Networks." In Encyclopedia of Cryptography, Security and Privacy. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-030-71522-9_1796.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jost, Daniel, Ueli Maurer, and João L. Ribeiro. "Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio." In Theory of Cryptography. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03807-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jarecki, Stanisław, and Xiaomin Liu. "Unlinkable Secret Handshakes and Key-Private Group Key Management Schemes." In Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72738-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cook, Debra L., John Ioannidis, Angelos D. Keromytis, and Jake Luck. "CryptoGraphics: Secret Key Cryptography Using Graphics Cards." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30574-3_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cachin, Christian. "Multi-Party Threshold Cryptography." In Trends in Data Protection and Encryption Technologies. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_13.

Full text
Abstract:
AbstractIn a threshold cryptosystem, the private key is typically distributed among parties that constitute the system using cryptographically secure secret sharing. Particular focus must be placed on generating the private key held jointly by the parties. Up to F of the parties might be faulty and leak their key shares, but F + 1 must cooperate in executing a cryptographic operation. Standards for threshold cryptography and the corresponding open-source implementations are expected to emerge because of the multi-year efforts driven by governmental or private-sector standardization agencies. F
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Secret-key cryptography"

1

"MOBILE SECRET KEY DISTRIBUTION WITH NETWORK CODING." In International Conference on Security and Cryptography. SciTePress - Science and and Technology Publications, 2007. http://dx.doi.org/10.5220/0002126801710174.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"CERTIFIED PSEUDONYMS COLLIGATED WITH MASTER SECRET KEY." In International Conference on Security and Cryptography. SciTePress - Science and and Technology Publications, 2009. http://dx.doi.org/10.5220/0002226501900197.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dey, Jayashree, and Ratna Dutta. "Code-based Key Encapsulation Mechanism Preserving Short Ciphertext and Secret Key." In 19th International Conference on Security and Cryptography. SCITEPRESS - Science and Technology Publications, 2022. http://dx.doi.org/10.5220/0011273900003283.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"A Novel Fuzzy Vault Scheme for Secret Key Exchange." In International Conference on Security and Cryptography. SciTePress - Science and and Technology Publications, 2012. http://dx.doi.org/10.5220/0004125404260429.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gazi, Peter, and Stefano Tessaro. "Secret-key cryptography from ideal primitives: A systematic overview." In 2015 IEEE Information Theory Workshop (ITW). IEEE, 2015. http://dx.doi.org/10.1109/itw.2015.7133163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Thiruppathy Kesavan, V., and S. Radhakrishnan. "Secret Key Cryptography based Security Approach for Wireless Sensor Networks." In 2012 International Conference on Recent Advances in Computing and Software Systems (RACSS). IEEE, 2012. http://dx.doi.org/10.1109/racss.2012.6212721.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Allam, Ahmed M., Hazem M. Abbas, and M. Watheq El-Kharashi. "Authenticated key exchange protocol using neural cryptography with secret boundaries." In 2013 International Joint Conference on Neural Networks (IJCNN 2013 - Dallas). IEEE, 2013. http://dx.doi.org/10.1109/ijcnn.2013.6707125.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Griotti, Mattia, Filippo Gandino, and Maurizio Rebaudengo. "Mixed public and secret-key cryptography for wireless sensor networks." In 2017 Tenth International Conference on Mobile Computing and Ubiquitous Network (ICMU). IEEE, 2017. http://dx.doi.org/10.23919/icmu.2017.8330094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gibson, F., A. Hening, M. Bourennane, et al. "Investigations on Long Wavelength Quantum Cryptography Systems." In The European Conference on Lasers and Electro-Optics. Optica Publishing Group, 1998. http://dx.doi.org/10.1364/cleo_europe.1998.cthh104.

Full text
Abstract:
Quantum cryptography is a technique for establishing a fundamentally secure key for cryptography using the encoding of the key on single photon states in such a way that an eavesdropper cannot acquire any information about the key without impairing detectable errors in the communication channel [1]. In the recent years there has been a remarkable progress in experimental implementations at 850 nm and 1300 nm wavelengths with secret key generation at kbits/s up to 48 km distance. However, for 1550 nm wavelength, where fiber losses are as smallest, progress has been hampered by the lack of good
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Shuiyin, Yi Hong, and Emanuele Viterbo. "Unshared secret key cryptography: Achieving Shannon's ideal secrecy and perfect secrecy." In 2014 IEEE Information Theory Workshop (ITW). IEEE, 2014. http://dx.doi.org/10.1109/itw.2014.6970909.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!