Log in

Relevant bibliographies by topics / Proxy public key cryptography

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Proxy public key cryptography'

Author: Grafiati

Published: 3 June 2025

Last updated: 19 July 2025

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 'Proxy public 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 "Proxy public key cryptography"

1

Chen, Jiahui, Jie Ling, Jianting Ning, et al. "Post quantum proxy signature scheme based on the multivariate public key cryptographic signature." International Journal of Distributed Sensor Networks 16, no. 4 (2020): 155014772091477. http://dx.doi.org/10.1177/1550147720914775.

Full text

Abstract:

Proxy signature is a very useful technique which allows the original signer to delegate the signing capability to a proxy signer to perform the signing operation. It finds wide applications especially in the distributed environment where the entities such as the wireless sensors are short of computational power and needed to be convinced to the authenticity of the server. Due to less proxy signature schemes in the post-quantum cryptography aspect, in this article, we investigate the proxy signature in the post-quantum setting so that it can resist against the potential attacks from the quantum adversaries. A general multivariate public key cryptographic proxy scheme based on a multivariate public key cryptographic signature scheme is proposed, and a heuristic security proof is given for our general construction. We show that the construction can reach Existential Unforgeability under an Adaptive Chosen Message Attack with Proxy Key Exposure assuming that the underlying signature is Existential Unforgeability under an Adaptive Chosen Message Attack. We then use our general scheme to construct practical proxy signature schemes for three well-known and promising multivariate public key cryptographic signature schemes. We implement our schemes and compare with several previous constructions to show our efficiency advantage, which further indicates the potential application prospect in the distributed network environment.

APA, Harvard, Vancouver, ISO, and other styles

2

K. Sudharani, Ms, and Dr N. K. Sakthivel. "Design and development of a secure certificateless proxy signature based (SE-CLPS) encryption scheme for cloud storage." International Journal of Engineering & Technology 10, no. 1 (2021): 57. http://dx.doi.org/10.14419/ijet.v10i1.21480.

Full text

Abstract:

Certificateless Public Key Cryptography (CL-PKC) scheme is a new standard that combines Identity (ID)-based cryptography and tradi- tional PKC. It yields better security than the ID-based cryptography scheme without requiring digital certificates. In the CL-PKC scheme, as the Key Generation Center (KGC) generates a public key using a partial secret key, the need for authenticating the public key by a trusted third party is avoided. Due to the lack of authentication, the public key associated with the private key of a user may be replaced by anyone. Therefore, the ciphertext cannot be decrypted accurately. To mitigate this issue, an Enhanced Certificateless Proxy Signature (E-CLPS) is proposed to offer high security guarantee and requires minimum computational cost. In this work, the Hackman tool is used for detecting the dictionary attacks in the cloud. From the experimental analysis, it is observed that the proposed E-CLPS scheme yields better Attack Detection Rate, True Positive Rate, True Negative Rate and Minimum False Positives and False Negatives than the existing schemes.

APA, Harvard, Vancouver, ISO, and other styles

3

Chadrakala and C. Lingareddy S. "Secure and Efficient Bi-Directional Proxy Re-Encyrption Technique." Indonesian Journal of Electrical Engineering and Computer Science 12, no. 3 (2018): 1143–50. https://doi.org/10.11591/ijeecs.v12.i3.pp1143-1150.

Full text

Abstract:

The low cost availability of smart devices and broadband connection has led to rapid growth of communication over Internet. As of today the internet based communication service is widely used in various application services such as in E-Mail transaction of sensitive data (medical data), online money transaction etc. all these services requires a strong security. There has been continuous ongoing research by various cryptanalyst to enhance security of cryptography especially in semi-untrusted server. However, performance, computation time and ease of use play a significant role in using the algorithm for implementation. Proxy re-encryption plays a significant role in protecting data that are stored in semi-untrusted server. Many existing Proxy re-encryption technique induces high computation overhead due to adoption of public key cryptography such RSA (Rivet Shamir Adleman), ECC (Elliptical Curve Cryptography) etc. and it suffer from quantum attack. To address this lattice based cryptography is adopted by various approaches which is based on Learning With Error which shows resilience against quantum attacks such Chosen Cipher data attack and Chosen Plain Text attack. The drawback with existing lattice cryptography based approach is that they are unidirectional and adopts bilinear pairing which compromise security and induces high computation cost. To address this work present a Bidirectional Proxy Re-encryption scheme by adopting lattice based cryptography technique. Experiment is conducted for computation overhead by varying key and data size which attained significant performance improvement over existing Proxy Re-encryption scheme.

APA, Harvard, Vancouver, ISO, and other styles

4

Kim, Won-Bin, Su-Hyun Kim, Daehee Seo, and Im-Yeong Lee. "Broadcast Proxy Reencryption Based on Certificateless Public Key Cryptography for Secure Data Sharing." Wireless Communications and Mobile Computing 2021 (December 16, 2021): 1–16. http://dx.doi.org/10.1155/2021/1567019.

Full text

Abstract:

Broadcast proxy reencryption (BPRE), which combines broadcast encryption (BE) and proxy reencryption (PRE), is a technology used for the redistribution of data uploaded on the cloud to multiple users. BPRE reencrypts data encrypted by the distributor and then uploads it to the cloud into a ciphertext that at a later stage targets multiple recipients. As a result of this, flexible data sharing is possible for multiple recipients. However, various inefficiencies and vulnerabilities of the BE, such as the recipient anonymity problem and the key escrow problem, also creep into BPRE. Our aim in this study was to address this problem of the existing BPRE technology. The partial key verification problem that appeared in the process of solving the key escrow problem was solved, and the computational efficiency was improved by not using bilinear pairing, which requires a lot of computation time.

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Su Li, and Jun Yao Ye. "Applied-Information Technology in Certificateless Proxy Signature Scheme without Bilinear Pairings." Applied Mechanics and Materials 685 (October 2014): 532–35. http://dx.doi.org/10.4028/www.scientific.net/amm.685.532.

Full text

Abstract:

This paper researches on the existing certificateless proxy signature scheme, there is almost no certificateless proxy signature scheme based on discrete logarithm up till now. Combining the knowledge of discrete logarithm over finite field and the advantages of certificateless cryptography, this paper proposes an efficient certificateless proxy signature scheme based on the discrete logarithm without bilinear pairings. To avoid the key escrow problem in the id-based cryptosystem and the saving certificate problem in the traditional public cryptography, meet the good properties of the proxy signature, such as unforgery, dependence of the proxy keys, distinguish of the proxy signature and anti-abuse. The scheme does not use the bilinear pairings, and based on the hard problem of discrete logarithm in the finite field, given the proof and discussion of the validity and security of the scheme.

APA, Harvard, Vancouver, ISO, and other styles

6

B M, Chandrakala, and S. C. Linga Reddy. "Secure and Efficient Bi-Directional Proxy Re-Encyrption Technique." Indonesian Journal of Electrical Engineering and Computer Science 12, no. 3 (2018): 1143. http://dx.doi.org/10.11591/ijeecs.v12.i3.pp1143-1150.

Full text

Abstract:

<p><span style="font-size: small;"><span>The low cost availability of smart devices and broadband connection has led to rapid growth of communication over Internet. As of today the internet based communication service is widely used in various application services such as in E-Mail transaction of sensitive data (medical data), online money transaction etc. all these services requires a strong security. There has been continuous ongoing research by various cryptanalyst to enhance security of cryptography especially in semi-untrusted server. However, performance, computation time and ease of use play a significant role in using the algorithm for implementation. Proxy re-encryption plays a significant role in protecting data that are stored in semi-untrusted server. Many existing Proxy re-encryption technique induces high computation overhead due to adoption of public key cryptography such RSA (Rivet Shamir Adleman), ECC (Elliptical Curve Cryptography) etc. and it suffer from quantum attack. To address this lattice based cryptography is adopted by various approaches which is based on Learning With Error which shows resilience against quantum attacks such Chosen Cipher data attack and Chosen Plain Text attack. The drawback with existing lattice cryptography based approach is that they are unidirectional and adopts bilinear pairing which compromise security and induces high computation cost. To address this work present a Bidirectional Proxy Re-encryption scheme by adopting lattice based cryptography technique. Experiment is conducted for computation overhead by varying key and data size which attained significant performance improvement over existing Proxy Re-encryption scheme.</span><br /></span></p>

APA, Harvard, Vancouver, ISO, and other styles

7

Mohd, Saiful Adli Mohamad, Din Roshidi, and Ilyani Ahmad Jasmin. "Research trends review on RSA scheme of asymmetric cryptography techniques." Bulletin of Electrical Engineering and Informatics 10, no. 1 (2021): 487–92. https://doi.org/10.11591/eei.v10i1.2493.

Full text

Abstract:

One of the cryptography classifications is asymmetric cryptography, which uses two different keys to encrypt and decrypt the message. This paper discusses a review of RSA scheme of asymmetric cryptography techniques. It is trying to present the domains of RSA scheme used including in public network, wireless sensor network, image encryption, cloud computing, proxy signature, Internet of Things and embedded device, based on the perspective of researchers’ effort in the last decade. Other than that, this paper reviewed the trends and the performance metrics of RSA scheme such as security, speed, efficiency, computational complexity and space based on the number of researches done. Finally, the technique and strengths of the proposed scheme are also stated in this paper.

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Yi. "Structure and Analysis of Certificateless Proxy Blind Signature Scheme without Bilinear Pairing." Advanced Materials Research 734-737 (August 2013): 3194–98. http://dx.doi.org/10.4028/www.scientific.net/amr.734-737.3194.

Full text

Abstract:

Combined with certificateless public key cryptography and proxy blind signature, an efficient certificateless proxy blind signature scheme is proposed. Its security is based on the discrete logarithm problem. Compared with the existed certificateless proxy blind signature scheme, because without bilinear pairing, it have higher efficiency. According to the different attacker and all kinds of attacks, the scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.

APA, Harvard, Vancouver, ISO, and other styles

9

REN, YANLI, DAWU GU, SHUOZHONG WANG, and XINPENGU ZHANG. "HIERARCHICAL IDENTITY-BASED PROXY RE-ENCRYPTION WITHOUT RANDOM ORACLES." International Journal of Foundations of Computer Science 21, no. 06 (2010): 1049–63. http://dx.doi.org/10.1142/s0129054110007726.

Full text

Abstract:

In a proxy re-encryption scheme, a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in public key settings. Hierarchical identity-based cryptography is a generalization of identity-based encryption that mirrors an organizational hierarchy, which allows a root private key generator to distribute the workload by delegating private key generation and identity authentication to lower-level private key generators. In this paper, we propose a hierarchical identity-based proxy re-encryption (HIBPRE) scheme which achieves IND-PrID-CCA2 security without random oracles. This is the first HIBPRE scheme up to now, and our scheme satisfies unidirectionality, non-interactivity and permits multiple re-encryptions.

APA, Harvard, Vancouver, ISO, and other styles

10

Mishra, Bharati, Debasish Jena, Ramasubbareddy Somula, and S. Sankar. "Secure Key Storage and Access Delegation Through Cloud Storage." International Journal of Knowledge and Systems Science 11, no. 4 (2020): 45–64. http://dx.doi.org/10.4018/ijkss.2020100104.

Full text

Abstract:

Cloud storage is gaining popularity to store and share files. To secure the files, cloud storage providers supply client interfaces with the facility to encrypt the files and upload them into the cloud. When client-side encryption is done, the onus of key management lies with the cloud user. Public key proxy re-encryption mechanisms can be used to distribute the key among stakeholders of the file. However, clients use low powered devices like mobile phones to share their files. Lightweight cryptography operations are needed to carry out the encryption operations. Ring-LWE-based encryption scheme meets this criterion. In this work, a proxy re-encryption scheme is proposed to distribute the file key. The scheme is proved CCA secure under Ring-LWE assumption in the random oracle model. The performance of the scheme is compared with the existing proxy re-encryption schemes which are observed to show better performance for re-encryption and re-key generation.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Proxy public key cryptography"

1

Möller, Bodo. "Public key cryptography theory and practice /." [S.l. : s.n.], 2003. http://elib.tu-darmstadt.de/diss/000372.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Han, Yong-Fei. "Fast algorithms for public key cryptography." Thesis, Royal Holloway, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.244544.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Melin, Tomas, and Tomas Vidhall. "Namecoin as authentication for public-key cryptography." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-108413.

Full text

Abstract:

Public-key cryptography is a subject that is very important to everyone who wants confidentiality and privacy in networks. It is important to understand how public-key cryptography systems work and what flaws they have. In the first part of this report we describe some of the most common encryption schemes and key agreements. We carefully investigate their flaws, if they are broken and what threats have dire consequences. We find that the biggest issue is authentication and we present current solutions to the problem. The current solutions are flawed because they rely too much on trusting different entities. It is only required that one trusted entity becomes malicious for the entire authentication system to be compromised. Because of this we propose an alternative system in the second part, Namecoin. A risk analysis in form of an attack tree is performed on the Namecoin system, where we describe how the attacks are executed and what you can do to prevent them. We present different threats against the system and we describe how dire the consequences are and the probability of their execution. Since Namecoin is an implementation of the block chain algorithm we have also explained how the block chain works in detail. We present why we think that Namecoin is a system that should replace the currently used certificate authority system. The certificate authority system is flawed because it is centralized and dependant on that no authority makes any mistakes. The Namecoin system does not become compromised unless more than 50 % of the hashrate in the system is used with malicious intent. We have concluded that the biggest threats against Namecoin have such a low probability that they can be neglected.

APA, Harvard, Vancouver, ISO, and other styles

4

Gaubatz, Gunnar. "Tamper-resistant arithmetic for public-key cryptography." Worcester, Mass. : Worcester Polytechnic Institute, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-030107-115645/.

Full text

Abstract:

Dissertation (Ph.D.)--Worcester Polytechnic Institute.<br>Keywords: Side Channel Attacks; Fault Attacks; Public-Key Cryptography; Error Detection; Error Detecting Codes. Includes bibliographical references (leaves 127-136).

APA, Harvard, Vancouver, ISO, and other styles

5

Wright, Moriah E. "RSA, Public-Key Cryptography, and Authentication Protocols." Youngstown State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1339297480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Heindl, Raymond A. "New directions in multivariate public key cryptography." Connect to this title online, 2009. http://etd.lib.clemson.edu/documents/1247508584/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

McIvor, C. "Algorithms and silicon architectures for public-key cryptography." Thesis, Queen's University Belfast, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.419513.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ferradi, Houda. "Integrity, authentication and confidentiality in public-key cryptography." Thesis, Paris Sciences et Lettres (ComUE), 2016. http://www.theses.fr/2016PSLEE045/document.

Full text

Abstract:

Cette thèse présente des résultats appartenant aux trois thèmes fondamentaux de la cryptographie à clé publique : l’intégrité, l’authentification et la confidentialité. Au sein de chaque thème nous concevons des nouvelles primitives et améliorons des primitives existantes. Le premier chapitre, dédié à l’intégrité, introduit une preuve non-interactive de génération appropriée de clés publiques RSA et un protocole de co-signature dans lequel tout irrespect de l’équité laisse automatiquement la partie lésée en possession d’une preuve de culpabilité incriminant la partie tricheuse. Le second chapitre, ayant pour sujet l’authentification, montre comme une mesure de temps permet de raccourcir les engagements dans des preuves à divulgation nulle et comment des biais, introduits à dessin dans le défi, permettent d’accroitre l’efficacité de protocoles. Ce chapitre généralise également le protocole de Fiat-Shamir à plusieurs prouveurs et décrit une fraude très sophistiquée de cartes-à-puce illustrant les dangers de protocoles d’authentification mal-conçus. Au troisième chapitre nous nous intéressons à la confidentialité. Nous y proposons un cryptosystème à clé publique où les hypothèses de complexité traditionnelles sont remplacées par un raffinement du concept de CAPTCHA et nous explorons l’application du chiffrement-pot-de-miel au langage naturel. Nos dernières contributions concernent le chiffrement basé sur l’identité (IBE). Nous montrerons comment ajouter des fonctions d’émission à l’IBE hiérarchique et comment l’IBE permet de réduire la fenêtre temporelle de risque lors de la diffusion de mises à jour logicielles<br>This thesis presents new results in three fundamental areas of public-key cryptography: integrity, authentication and confidentiality. In each case we design new primitives or improve the features of existing ones. The first chapter, dealing with integrity, introduces a non-interactive proof for proper RSA public key generation and a contract co-signature protocol in which a breach in fairness provides the victim with transferable evidence against the cheater. The second chapter, focusing on authentication, shows how to use time measurements to shorten zeroknowledge commitments and how to exploit bias in zero-knowledge challenges to gain efficiency. This chapter also generalizes Fiat-Shamir into a one-to-many protocol and describes a very sophisticated smart card fraud illustrating what can happen when authentication protocols are wrongly designed. The third chapter is devoted to confidentiality. We propose public-key cryptosystems where traditional hardness assumptions are replaced by refinements of the CAPTCHA concept and explore the adaptation of honey encryption to natural language messages. Our final contributions focus on identity-based encryption (IBE) showing how to add broadcast features to hierarchical IBE and how to use IBE to reduce vulnerability exposure time of during software patch broadcast

APA, Harvard, Vancouver, ISO, and other styles

9

Hettinger, Christopher James. "A New Public-Key Cryptosystem." BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/5492.

Full text

Abstract:

Public key cryptosystems offer important advantages over symmetric methods, but the most important such systems rely on the difficulty of integer factorization (or the related discrete logarithm problem). Advances in quantum computing threaten to render such systems useless. In addition, public-key systems tend to be slower than symmetric systems because of their use of number-theoretic algorithms. I propose a new public key system which may be secure against both classical and quantum attacks, while remaining simple and very fast. The system's action is best described in terms of linear algebra, while its security is more naturally explained in the context of graph theory.

APA, Harvard, Vancouver, ISO, and other styles

10

Gjøsteen, Kristian. "Subgroup membership problems and public key cryptosystems." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2004. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-128.

Full text

Abstract:

<p>Public key encryption was first proposed by Diffie and Hellman [16], and widely popularised with the RSA cryptosystem [37]. Over the years, the security goals of public key encryption have been studied [17, 22], as have adversary models [30, 36], and many public key cryptosystems have been proposed and analysed.</p><p>It turns out that the security of many of those cryptosystems [16, 18, 22, 29, 34, 35] are based on a common class of mathematical problems, called subgroup membership problems. Cramer and Shoup [10] designed a chosen-ciphertextsecure cryptosystem based on a general subgroup membership problem (generalising their previous work [9]), and provided two new instances. Yamamura and Saito [41] defined a general subgroup membership problem, catalogued several known subgroup membership problems, and designed a private information retrieval system based on a subgroup membership problem. Nieto, Boyd and Dawson [31] designed a cryptosystem based on essentially a symmetric subgroup membership problem (see Section 4.4 and Section 6.1).</p><p>Chapter 2 and 3 contain certain preliminary discussions necessary for the later work. In Chapter 4, we discuss subgroup membership problems, both abstractly and concrete families. For all of the concrete examples, there is a related problem called the splitting problem. We discuss various elementary reductions, both abstract and for concrete families. In cryptographic applications, a third related problem, called the subgroup discrete logarithm problem, is also interesting, and we discuss this in some detail. We also discuss a variant of the subgroup membership problem where there are two subgroups that are simultaneously hard to distinguish. We prove a useful reduction (Theorem 4.11) for this case. The technique used in the proof is reused throughout the thesis.</p><p>In Chapter 5, we discuss two homomorphic cryptosystems, based on trapdoor splitting problems. This gives us a uniform description of a number of homomorphic cryptosystems, and allows us to apply the theory and results of Chapter 4 to the security of those cryptosystems.</p><p>Using the technique of Theorem 4.11, we develop a homomorphic cryptosystem that is not based on a trapdoor problem. This gives us a fairly efficient cryptosystem, with potentially useful properties.</p><p>We also discuss the security of a homomorphic cryptosystem under a nonstandard assumption. While these results are very weak, they are stronger than results obtained in the generic model.</p><p>In Chapter 6, we develop two key encapsulation methods. The first can be proven secure against passive attacks, using the same technique as in the proof of Theorem 4.11. The second method can be proven secure against active attacks in the random oracle model, but to do this, we need a certain non-standard assumption.</p><p>Finally, in Chapter 7 we discuss a small extension to the framework developed by Cramer and Shoup [10], again by essentially reusing the technique used to prove Theorem 4.11. This gives us a cryptosystem that is secure against chosen ciphertext attacks, without recourse to the random oracle model or nonstandard assumptions. The cryptosystem is quite practical, and performs quite well compared to other variants of the Cramer-Shoup cryptosystem.</p>

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Proxy public key cryptography"

1

Garrett, Paul, and Daniel Lieman, eds. Public-Key Cryptography. American Mathematical Society, 2005. http://dx.doi.org/10.1090/psapm/062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Salomaa, Arto. Public-Key Cryptography. Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-662-02627-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Imai, Hideki, and Yuliang Zheng, eds. Public Key Cryptography. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0054009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Batten, Lynn Margaret. Public Key Cryptography. John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118482261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Naccache, David, and Pascal Paillier, eds. Public Key Cryptography. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45664-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Imai, Hideki, and Yuliang Zheng, eds. Public Key Cryptography. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/b75033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kim, Kwangjo, ed. Public Key Cryptography. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44586-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Salomaa, Arto. Public-Key Cryptography. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/978-3-662-03269-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Nechvatal, James. Public-key cryptography. U.S. Dept. of Commerce, National Institute of Standards and Technology, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Nechvatal, James. Public-key cryptography. Computer Systems Laboratory, National Institute of Standards and Technology, U.S. Dept. of Commerce, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Proxy public key cryptography"

1

Bleumer, Gerrit. "Public Key Proxy Encryption." In Encyclopedia of Cryptography and Security. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bleumer, Gerrit. "Public Key Proxy Signatures." In Encyclopedia of Cryptography and Security. Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jakobsson, Markus. "On Quorum Controlled Asymmetric Proxy Re-encryption." In Public Key Cryptography. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-49162-7_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bleumer, Gerrit. "Public Key Proxy Encryption." In Encyclopedia of Cryptography, Security and Privacy. Springer Berlin Heidelberg, 2023. http://dx.doi.org/10.1007/978-3-642-27739-9_217-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bleumer, Gerrit. "Public Key Proxy Encryption." In Encyclopedia of Cryptography, Security and Privacy. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-030-71522-9_217.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bleumer, Gerrit. "Public Key Proxy Signatures." In Encyclopedia of Cryptography, Security and Privacy. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-030-71522-9_218.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Döttling, Nico, and Ryo Nishimaki. "Universal Proxy Re-Encryption." In Public-Key Cryptography – PKC 2021. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-75245-3_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Fuchsbauer, Georg, Chethan Kamath, Karen Klein, and Krzysztof Pietrzak. "Adaptively Secure Proxy Re-encryption." In Public-Key Cryptography – PKC 2019. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17259-6_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kirshanova, Elena. "Proxy Re-encryption from Lattices." In Public-Key Cryptography – PKC 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-642-54631-0_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Shao, Jun, and Zhenfu Cao. "CCA-Secure Proxy Re-encryption without Pairings." In Public Key Cryptography – PKC 2009. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00468-1_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Proxy public key cryptography"

1

Chen, Lei, Siyuan Ni, Yuyao Wang, Fei Yu, and Yuanhang He. "Content Security Distribution Scheme Based on Certificateless Public Key Cryptography." In 2024 IEEE 12th International Conference on Information, Communication and Networks (ICICN). IEEE, 2024. https://doi.org/10.1109/icicn62625.2024.10761210.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Havanur, Smitha G., and Abey Jacob. "Approach to Post Quantum Cryptography Validation." In 2024 IEEE International Conference on Public Key Infrastructure and its Applications (PKIA). IEEE, 2024. http://dx.doi.org/10.1109/pkia62599.2024.10727560.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gervais, Mwitende. "Lightweight Certificateless Authenticated Key Agreement Protocol." In 10th International Conference on Artificial Intelligence & Applications. Academy & Industry Research Collaboration Center, 2023. http://dx.doi.org/10.5121/csit.2023.131928.

Full text

Abstract:

Data security and privacy are important to prevent the reveal, modification and unauthorized usage of sensitive information. The introduction of using critical power devices for internet of things (IoTs), e-commerce, e-payment, and wireless sensor networks (WSNs) has brought a new challenge of security due to the low computation capability of sensors. Therefore, the lightweight authenticated key agreement protocols are important to protect their security and privacy. Several researches have been published about authenticated key agreement. However, there is a need of lightweight schemes that can fit with critical capability devices. Addition to that, a malicious key generation center (KGC) can become a threat to watch other users, i.e impersonate user by causing the key escrow problem. Therefore, we propose a lightweight certificateless Authenticated Key Agreement (AKA) based on the computation Diffie-Hellman problem (CDHP). The proposed protocol maintains the characteristics of certificateless public key cryptography. The protocol is split into two combined phases. In the first phase, our protocol establishes a session key between users (sender and receiver). In the second phase, we use a lightweight proxy blind signature based on elliptic curve discrete logarithm problem (ECDLP). The used proxy signature has small computation costs, and can fit for small devices such sensors and protects against un-authentication and un-authorization on decentralized system. Compared to the existing AKA schemes, our scheme has small computation costs. The protocol achieves the well known security features compared to the related protocols.

APA, Harvard, Vancouver, ISO, and other styles

4

Perlner, Ray A., and David A. Cooper. "Quantum resistant public key cryptography." In the 8th Symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1527017.1527028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Abdulla, Mohamed, and Muhammad Ehsan Rana. "Vulnerabilities in Public Key Cryptography." In 3rd International Conference on Integrated Intelligent Computing Communication & Security (ICIIC 2021). Atlantis Press, 2021. http://dx.doi.org/10.2991/ahis.k.210913.079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Gupta, Anjali, and Muzzammil Hussain. "Secure Session Key Sharing Using Public Key Cryptography." In the Third International Symposium. ACM Press, 2015. http://dx.doi.org/10.1145/2791405.2791448.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Caboara, Massimo, Fabrizio Caruso, and Carlo Traverso. "Gröbner bases for public key cryptography." In the twenty-first international symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1390768.1390811.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Batina, L., J. Guajardo, T. Kerins, N. Mentens, P. Tuyls, and I. Verbauwhede. "Public-Key Cryptography for RFID-Tags." In Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07). IEEE, 2007. http://dx.doi.org/10.1109/percomw.2007.98.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Boyarsky, Maurizio Kliban. "Public-key cryptography and password protocols." In the 6th ACM conference. ACM Press, 1999. http://dx.doi.org/10.1145/319709.319719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Coleman, Tom A., James A. Kitchener, David L. Pudney, Kelvin D. Wauchope, and Braden J. Phillips. "An RNS public key cryptography accelerator." In Smart Materials, Nano- and Micro-Smart Systems, edited by Said F. Al-Sarawi. SPIE, 2006. http://dx.doi.org/10.1117/12.695962.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Proxy public key cryptography"

1

Nechvatal, James. Public-key cryptography. National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.sp.800-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

BEAVER, CHERYL L., TIMOTHY J. DRAELOS, VICTORIA A. HAMILTON, et al. Low-Power Public Key Cryptography. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/767206.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wakid, Shukri. Entity Authentication Using Public Key Cryptography. Defense Technical Information Center, 1997. http://dx.doi.org/10.21236/ada408513.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Turner, S., D. Brown, K. Yiu, R. Housley, and T. Polk. Elliptic Curve Cryptography Subject Public Key Information. RFC Editor, 2009. http://dx.doi.org/10.17487/rfc5480.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gutmann, P., and C. Bonnell. Standard Public Key Cryptography (PKC) Test Keys. RFC Editor, 2023. http://dx.doi.org/10.17487/rfc9500.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Jonsson, J., and B. Kaliski. Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. RFC Editor, 2003. http://dx.doi.org/10.17487/rfc3447.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Zhu, L., and B. Tung. Public Key Cryptography for Initial Authentication in Kerberos (PKINIT). RFC Editor, 2006. http://dx.doi.org/10.17487/rfc4556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ito, T., and S. Turner. Clarifications for Elliptic Curve Cryptography Subject Public Key Information. RFC Editor, 2020. http://dx.doi.org/10.17487/rfc8813.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Zhu, L., K. Jaganathan, and K. Lauter. Elliptic Curve Cryptography (ECC) Support for Public Key Cryptography for Initial Authentication in Kerberos (PKINIT). RFC Editor, 2008. http://dx.doi.org/10.17487/rfc5349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Carroll, Thomas, Lindsey Redington, Addison Moran-Schmoker, and Andrew Murray. Inventory of Public Key Cryptography in US Electric Vehicle Charging. Office of Scientific and Technical Information (OSTI), 2023. http://dx.doi.org/10.2172/2204867.

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!