Добірка наукової літератури з теми "Pairing Scheme"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Pairing Scheme".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Pairing Scheme"
Chin, Ji-Jian, Syh-Yuan Tan, Swee-Huay Heng, and Raphael Chung-Wei Phan. "Twin-Schnorr: A Security Upgrade for the Schnorr Identity-Based Identification Scheme." Scientific World Journal 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/237514.
Повний текст джерелаLiu, Wenhao, Qi Xie, Shengbao Wang, Lidong Han, and Bin Hu. "Pairing-Free Certificateless Signature with Security Proof." Journal of Computer Networks and Communications 2014 (2014): 1–6. http://dx.doi.org/10.1155/2014/792063.
Повний текст джерелаLuc, Nhu-Quynh, Quang-Trung Do, and Manh-Hung Le. "Implementation of Boneh - Lynn - Shacham short digital signature scheme using Weil bilinear pairing based on supersingular elliptic curves." Ministry of Science and Technology, Vietnam 64, no. 12 (December 15, 2022): 3–9. http://dx.doi.org/10.31276/vjste.64(4).03-09.
Повний текст джерелаSugiyama, Masaki, Aohan Li, Zengchao Duan, Makoto Naruse, and Mikio Hasegawa. "BER Minimization by User Pairing in Downlink NOMA Using Laser Chaos Decision-Maker." Electronics 11, no. 9 (April 30, 2022): 1452. http://dx.doi.org/10.3390/electronics11091452.
Повний текст джерелаZhang, Jian Hong, Hua Chen, and Yi Xian Yang. "Efficient Blind Signature Scheme Based on Modified Generalized Bilinear Inversion." Key Engineering Materials 439-440 (June 2010): 1265–70. http://dx.doi.org/10.4028/www.scientific.net/kem.439-440.1265.
Повний текст джерелаKiran, Medikonda Asha, Syam Kumar Pasupuleti, and R. Eswari. "Efficient Pairing-Free Identity-Based Signcryption Scheme for Cloud-Assisted IoT." International Journal of Cloud Applications and Computing 12, no. 1 (January 1, 2022): 1–15. http://dx.doi.org/10.4018/ijcac.305216.
Повний текст джерелаGao, Ronghai, Jiwen Zeng, and Lunzhi Deng. "Efficient Certificateless Anonymous Multi-Receiver Encryption Scheme without Bilinear Parings." Mathematical Problems in Engineering 2018 (July 24, 2018): 1–13. http://dx.doi.org/10.1155/2018/1486437.
Повний текст джерелаDONG, GUOFAGN, FEI GAO, WENBO SHI, and PENG GONG. "An efficient certificateless blind signature scheme without bilinear pairing." Anais da Academia Brasileira de Ciências 86, no. 2 (June 2014): 1003–11. http://dx.doi.org/10.1590/0001-3765201420130199.
Повний текст джерелаChin, Ji-Jian, Syh-Yuan Tan, Swee-Huay Heng, and Raphael C. W. Phan. "Efficient and Provable Secure Pairing-Free Security-Mediated Identity-Based Identification Schemes." Scientific World Journal 2014 (2014): 1–14. http://dx.doi.org/10.1155/2014/170906.
Повний текст джерелаYang, Kaiqin. "An enhanced pairing-free certificateless directed signature scheme." PLOS ONE 17, no. 2 (February 17, 2022): e0263943. http://dx.doi.org/10.1371/journal.pone.0263943.
Повний текст джерелаДисертації з теми "Pairing Scheme"
Xiong, Hao, and 熊昊. "Leakage resilient cryptographic scheme and GPU-based pairing operation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/195962.
Повний текст джерелаpublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Varga, Ondrej. "Efektivní schémata digitálních podpisů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219303.
Повний текст джерелаRezazadeh, Baee Mir Ali. "Privacy-preserving authentication and key management for cooperative intelligent transportation systems." Thesis, Queensland University of Technology, 2021. https://eprints.qut.edu.au/212412/1/Mir%20Ali_Rezazadeh%20Baee_Thesis.pdf.
Повний текст джерелаAl-Riyami, Sattam. "Cryptographic schemes based on elliptic curve pairings." Thesis, Royal Holloway, University of London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.409744.
Повний текст джерелаLippold, Georg. "Encryption schemes and key exchange protocols in the certificateless setting." Thesis, Queensland University of Technology, 2010. https://eprints.qut.edu.au/41697/1/Georg_Lippold_Thesis.pdf.
Повний текст джерелаChen, I.-Chao, and 陳怡超. "A Revocation Scheme from the Weil Pairing." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/86563885868141305283.
Повний текст джерела國立交通大學
資訊科學系
91
A Revocation Scheme from the Weil Pairing Student:I-Chao Chen Advisor:Dr. Wen-Guey Tzeng Institute of Computer and Information Science National Chiao Tung University Abstract We deal with the broadcast encryption system that a center sends a message to a group of users which some of them are revoked and can not decrypt the message. We concentrate on stateless receiver case, where receivers can not update their private information from session to session. We propose a subset-cover revocation algorithm based on Weil Pairing. The algorithm is pretty flexible that it can revoke any users and efficiently send messages to privileged users. Even the coalition of the revoked users can not decrypt the message. Besides, our revocation scheme has the tracing property also. In our scheme, each user stores N private keys and in order to revoke r users, the message length which the center transmits is r+1 at most. Every user only needs to decrypt one time when receiving the message. Our method is better than previous proposed methods with respect to the required message length. (N is the number of total users, r is the number of revoked users) Key words:Broadcast Encryption System, Revocation Scheme
陳美智. "Threshold Proxy Signature Scheme Using Pairing System." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/18040768779206724573.
Повний текст джерелаMalinga, Sandile Kwanele, and Sandile Kwanele Malinga. "A Pairing-Free Signature-Verified Cryptonym-Based Group Key Agreement Scheme." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/t3qvh6.
Повний текст джерела國立勤益科技大學
資訊工程系
107
In recent years the influx of mobile communication devices like cellular phones and laptops have made communication and data sharing extremely easier over long distances. These communication technologies have seen the introduction of the internet which is a public network to be frequently used since it is the most cost-effective kind of network. The flexibility of public networks has been adopted by global businesses which has seen the introduction of online/distance learning. When using public networks, the information of the users must be secured at all times. Identity-based authenticated group key agreement (ID-GKA) protocols have been proposed to secure communication over public networks. Many of these previously proposed ID_GKA protocols require bilinear pairings for security, although this is good but it is not suitable for low power devices. Those that do not require pairings do not verify the identity of the user during messages exchanged which exposes the system to user impersonification attacks. In this paper, we propose A Pairing-Free Signature-Verified Cryptonym-Based Group Key Agreement Scheme. The proposed protocol is resilient against a lot of attacks such as known session key security, insider attacks and perfect forward secrecy. In addition, the proposed protocol is suitable for low-power devices as it uses the elliptic curve scalar point multiplication (ECMP).
Lin, Jyun-yu, and 林峻宇. "Analysis of network security directed user authentication scheme using bilinear pairing over elliptic curves." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/98816025445039993879.
Повний текст джерела南華大學
資訊管理學研究所
94
The information security with the internet has become a serious issue recently to us. In order to protect the transaction security, many cryptosystem has developed such as RSA which based on the complex discrete logarithm problem. Recently, bilinear pairings such as Weil pairing and Tate pairing defined on elliptic curves were proved and could be applied to cryptography in 2001. It possesses faster computation and fewer bits but remaining the same security level as other public key cryptosystems, like the traditional RSA cryptosystem. In this paper, we review some exist security attributes and point out the current cryptosystem based on bilinear pairings which proposed by Manik which has some weaknesses. After that, we proposed few improvement of their scheme.
Islam, Shama Naz. "Multi-way relay networks: characterization, performance analysis and transmission scheme design." Phd thesis, 2015. http://hdl.handle.net/1885/13648.
Повний текст джерелаКниги з теми "Pairing Scheme"
The National heritage arts sponsorship scheme: Applying for the Pairing Scheme. London: ABSA, 1997.
Знайти повний текст джерелаAssociation for Business Sponsorship of the Arts. The National heritage arts sponsorship scheme: Applying for the Pairing Scheme. ABSA, 1995.
Знайти повний текст джерелаMorawetz, Klaus. Systems with Condensates and Pairing. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198797241.003.0012.
Повний текст джерелаЧастини книг з теми "Pairing Scheme"
Kim, Jongkil, Willy Susilo, Man Ho Au, and Jennifer Seberry. "Efficient Semi-static Secure Broadcast Encryption Scheme." In Pairing-Based Cryptography – Pairing 2013, 62–76. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04873-4_4.
Повний текст джерелаDubois, Renaud, Aurore Guillevic, and Marine Sengelin Le Breton. "Improved Broadcast Encryption Scheme with Constant-Size Ciphertext." In Pairing-Based Cryptography – Pairing 2012, 196–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36334-4_12.
Повний текст джерелаRasslan, Mohamed, and Amr Youssef. "A Bilinear Pairing Based Hidden-Signature Scheme." In Communications in Computer and Information Science, 389–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14171-3_34.
Повний текст джерелаSun, Yinxia, Zhuoran Zhang, and Limin Shen. "A Revocable Certificateless Signature Scheme Without Pairing." In Cloud Computing and Security, 355–64. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-48671-0_32.
Повний текст джерелаXia, Meichen, and Zhimin Chen. "A New Pairing-Based Scheme for Anonymous Communication System." In Communications in Computer and Information Science, 13–20. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-8101-4_2.
Повний текст джерелаBrickell, Ernie, and Jiangtao Li. "A Pairing-Based DAA Scheme Further Reducing TPM Resources." In Trust and Trustworthy Computing, 181–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13869-0_12.
Повний текст джерелаLiao, Jian, Yinghao Qi, Peiwei Huang, and Mentian Rong. "Pairing-Based Provable Blind Signature Scheme Without Random Oracles." In Computational Intelligence and Security, 161–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11596981_24.
Повний текст джерелаSharmila Deva Selvi, S., Arinjita Paul, and Chandrasekaran Pandu Rangan. "An Efficient Certificateless Proxy Re-Encryption Scheme Without Pairing." In Provable Security, 413–33. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68637-0_25.
Повний текст джерелаKhalfaoui, Sameh, Jean Leneutre, Arthur Villard, Jingxuan Ma, and Pascal Urien. "COOB: Hybrid Secure Device Pairing Scheme in a Hostile Environment." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 419–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63095-9_27.
Повний текст джерелаMasaracchia, Antonino, Long D. Nguyen, Trung Q. Duong, Daniel B. da Costa, and Thuong Le-Tien. "User-Pairing Scheme in NOMA Systems: A PSO-Based Approach." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 18–25. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30149-1_2.
Повний текст джерелаТези доповідей конференцій з теми "Pairing Scheme"
Li, Long-Hai, Cheng-Qiang Huang, and Shao-Feng Fu. "Pairing-Based Anonymous Boardroom Voting Scheme." In 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2014. http://dx.doi.org/10.1109/cyberc.2014.54.
Повний текст джерелаJalal, Saba, and Brian King. "A pairing based cryptographic anonymous authentication scheme." In the 5th International Confernece. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1968613.1968652.
Повний текст джерелаHuang, Ye, and Geng Yang. "Pairing-Based Dynamic Threshold Secret Sharing Scheme." In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2010. http://dx.doi.org/10.1109/wicom.2010.5601381.
Повний текст джерелаSeo, Seung-Hyun, Mohamed Nabeel, Xiaoyu Ding, and Elisa Bertino. "An efficient certificateless cryptography scheme without pairing." In the third ACM conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2435349.2435375.
Повний текст джерелаJing, Xiaofei. "Provably secure certificateless signcryption scheme without pairing." In Mechanical Engineering and Information Technology (EMEIT). IEEE, 2011. http://dx.doi.org/10.1109/emeit.2011.6024098.
Повний текст джерелаTang, Peng-zhi, Qing-lan Zhang, and Jun-fang Yang. "Certificateless signcryption scheme based on bilinear pairing." In 2015 2nd International Conference on Wireless Communication and Sensor Network (WCSN 2015). WORLD SCIENTIFIC, 2016. http://dx.doi.org/10.1142/9789813140011_0046.
Повний текст джерелаWang, Mingwen, Zhiyuan Ren, Jun Cai, and Wentao Zheng. "A biometric signcryption scheme without bilinear pairing." In 2012 International Conference on Graphic and Image Processing, edited by Zeng Zhu. SPIE, 2013. http://dx.doi.org/10.1117/12.2002003.
Повний текст джерелаHans, Sushma, and S. Chakraverty. "A skillbased pairing scheme for effective collaborations." In 2016 1st India International Conference on Information Processing (IICIP). IEEE, 2016. http://dx.doi.org/10.1109/iicip.2016.7975304.
Повний текст джерелаCui, Li, Bai Yun, Shi Lin, and Bai Wenhua. "A New Certificateless Signcryption Scheme Without Bilinear Pairing." In 2018 13th International Conference on Computer Science & Education (ICCSE). IEEE, 2018. http://dx.doi.org/10.1109/iccse.2018.8468859.
Повний текст джерелаHuang, Bo, Xuming Fang, Qing Chen, Rong He, and Wu Chen. "A Pairing Scheduling Scheme for Virtual MIMO Systems." In 2010 6th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM). IEEE, 2010. http://dx.doi.org/10.1109/wicom.2010.5601378.
Повний текст джерела