Добірка наукової літератури з теми "Blind signature scheme"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Blind signature scheme".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Blind signature scheme"
Deng, Yu Qiao. "A Blind Proxy Re-Signatures Scheme Based on Random Oracle." Advanced Materials Research 204-210 (February 2011): 1062–65. http://dx.doi.org/10.4028/www.scientific.net/amr.204-210.1062.
Повний текст джерелаHoang Duong, Dung, Willy Susilo, and Ha Thanh Nguyen Tran. "A Multivariate Blind Ring Signature Scheme." Computer Journal 63, no. 8 (November 26, 2019): 1194–202. http://dx.doi.org/10.1093/comjnl/bxz128.
Повний текст джерела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.
Повний текст джерелаTan, Duc Nguyen, Hai Nguyen Nam, Minh Nguyen Hieu, and Hiep Nguyen Van. "New Blind Muti-signature Schemes based on ECDLP." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 2 (April 1, 2018): 1074. http://dx.doi.org/10.11591/ijece.v8i2.pp1074-1083.
Повний текст джерелаZhang, Weijian, Zhimin Guo, Nuannuan Li, Mingyan Li, Qing Fan, and Min Luo. "A Blind Signature-Aided Privacy-Preserving Power Request Scheme for Smart Grid." Wireless Communications and Mobile Computing 2021 (June 29, 2021): 1–10. http://dx.doi.org/10.1155/2021/9988170.
Повний текст джерелаZhou, Xuan Wu. "Fast Public Key Cryptosystem Based Blind Signature Scheme." Applied Mechanics and Materials 20-23 (January 2010): 505–11. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.505.
Повний текст джерелаMa, Li Zhen. "Efficient Convertible User Designating Confirmer Partially Blind Signature with Provable Security." Advanced Materials Research 282-283 (July 2011): 307–11. http://dx.doi.org/10.4028/www.scientific.net/amr.282-283.307.
Повний текст джерелаCAI, XIAO-QIU, and HUI-FANG NIU. "PARTIALLY BLIND SIGNATURES BASED ON QUANTUM CRYPTOGRAPHY." International Journal of Modern Physics B 26, no. 30 (October 7, 2012): 1250163. http://dx.doi.org/10.1142/s0217979212501639.
Повний текст джерелаJames, Salome, T. Gowri, G. V. Ramesh Babu, and P. Vasudeva Reddy. "Identity-Based Blind Signature Scheme with Message Recovery." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 5 (October 1, 2017): 2674. http://dx.doi.org/10.11591/ijece.v7i5.pp2674-2682.
Повний текст джерелаManoj Kumar Chande. "An improved proxy blind signature scheme based on ECDLP." Malaya Journal of Matematik 2, no. 03 (July 1, 2014): 228–35. http://dx.doi.org/10.26637/mjm203/007.
Повний текст джерелаДисертації з теми "Blind signature scheme"
Maitland, Gregory. "Design of practical electronic cash schemes." Thesis, Queensland University of Technology, 2003.
Знайти повний текст джерелаHuang, Ren-Shang, and 黃任賞. "Blind Signature Scheme with Anonymous Verification." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/92137150916184951504.
Повний текст джерела國立中山大學
資訊工程學系研究所
98
In an anonymous credential system, when a credential has been shown for verification, none can identify the owner of the credential and link the relationship between any two credentials. The unlinkability is the crucial feature for any anonymous credential system. In 2002, Jan Camenisch and Anna Lysyanskaya proposed a signature scheme (CL signature) which allows users to demonstrate their credentials without revealing their identity information. However, CL signature is compounded of a lot of zero-knowledge proof technologies which cause inefficiency for CL signatures. Such heavy computation requirements may limit the scope which CL signatures can be applied to. In this thesis, we propose a new blind signature scheme based on ElGamal signatures and design an anonymous verification procedure which is more efficient than the CL signature scheme. Finally, we also implement our proposed protocols.
Muduli, J. P., and S. K. Parida. "A Blind Signature Scheme using Biometric Feature Value." Thesis, 2010. http://ethesis.nitrkl.ac.in/1672/1/blind_Signature_by_Jyoti_and_Sanjaya_10606032_10606035.pdf.
Повний текст джерелаChang, Yu-Wen, and 張郁文. "A New Fair Blind Signature Scheme with Message Recovery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/35848537605449483316.
Повний текст джерела逢甲大學
資訊工程所
93
Abstract Because of present commercial transactions most used electronizations, it needs to have anonymous function mechanisms, that’s why we need blind signatures . So Chaum had proposed the blind signature at first in 1982.The blind signature had two following characteristics: (1)anonymous (2 ) untraceable. Those properties were applied in lots of electronic payment systems. Because of two characteristics of it, it may be used for crimes like “blackmailing” and “money laundering. So, M.Stadler proposed the fair blind signature scheme to prevent these guilt problems in 1995. They have joined “The Third Trust Party” in the system, it can prevent Signer’s forge attack and trace the questionable Sender. Lee and Kim combined the “fair blind signature” and “meta-Elgamal signature scheme” and proposed”A Fair Blind Signature Scheme with Message Recovery” But, Hsien had found the security problem of the Lee-Kim scheme in 2000.Then they proposed the way that can pass the verification. Then Chung proposed an improved scheme in 2002 afterwards, but it suffered the same attack. Tsao,Chou had proposed a improved scheme based on the elliptic curves cryptosystem, and can avoid the attack of forging revocation keys. But these proposed methods all ignore the attack that Sender may cheat the TTP and Signer, and bring the security problems. Our scheme will add the interaction between Sender and TTP, and improve the Taso-Chou scheme. Then we will prevent “A New Fair Blind Signature Scheme with Message Recovery” that based on the elliptic curves.
Hung, Chen Chien, and 洪誠謙. "An unlinkable blind signature scheme for Location-Based Service." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/60044406294808013207.
Повний текст джерела長庚大學
資訊管理學研究所
96
More and more obvious applications rely on the Location-Based Services (LBS) that offer highly personalized services to the subscriber based on their current position using the Global Positioning System (GPS) [2] and Wireless Communications. Generally, the LBS track the position of users on the network while inside the facility, and then collect this position information for the users, such as information on restaurants and stores, police stations, gas stations, hospitals, etc. When the exchange of details of service is done via an untrusted telecommunications company (TC), the privacy of the user could be in jeopardy. In this work, we propose a new scheme for user privacy in the LBS, which does not rely on a trusted TC between the user and service provider. We believe that the scheme in the LBS will provide better privacy and security for the users.
Nan, Guo Shin, and 郭信男. "Proxy Blind Signature Scheme with Proxy Signer Privacy Protection." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/01524065998773469285.
Повний текст джерелаSun, Wei-Zhe, and 孫偉哲. "Provably Secure Randomized Blind Signature Scheme and Its Application." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/46341187861514001440.
Повний текст джерела國立中山大學
資訊工程學系研究所
99
Due to resource-saving and efficiency consideration, electronic voting (e-voting) gradually replaces traditional paper-based voting in some developed countries. An anonymous e-voting system that can be used in elections with large electorates must meet various security requirements, such as anonymity, uncoercibility, tally correctness, unrecastability, verifiability, and so on. Especially, the uncoercibility property is an essential property which can greatly reduce the possibility of coercion and bribe. Since each voter can obtain one and only one voting receipt in an electronic voting system, coercers or bribers can enforce legal voters to show their voting receipts to identify whether the enforced voters follow their will or not. It turns out that the coercion and bribe will succeed more easily in digital environments than that in traditional paper-based voting. In this dissertation, we analyze four possible scenarios leading to coercion and discover that the randomization property is necessary to blind-signature-based e-voting systems against coercion. Based on this result, we extend our research and come up with two provably secure randomized blind signature schemes from different cryptographic primitives, which can be adopted as key techniques for an electronic voting system against coercion and bribery.
Sie, Yu-Heng, and 謝宇恆. "Security Improvement of A Proxy Blind Signature Scheme Based on DLP." Thesis, 2019. http://ndltd.ncl.edu.tw/cgi-bin/gs32/gsweb.cgi/login?o=dnclcdr&s=id=%22107NCHU5394038%22.&searchmode=basic.
Повний текст джерела國立中興大學
資訊科學與工程學系所
107
Nowadays, increasingly developed generation of the Internet, more and more objects are evolving into electronics, creating a developed e-commerce. Like electronic invoices, mobile payments, electronic voting, etc. These applications use encryption, decryption, and digital signatures in cryptography to satisfy security issues. Proxy blind signatures, which combine the proxy signature and the blind signature, are suitable for such applications. The scheme proposed in the paper [7], although having relatively low computation compared with previous related papers, can satisfy the security conditions that should be possessed by proxy blind signatures. However, in the verification, we play an attacker, trying to make changes to the contents of the complete file, and obtaining the corresponding fake signature by verification, the verification still holds, and the verifier cannot recognize this difference. In this paper, the encryption, decryption and verification methods in the Schnorr Signature mechanism are used to modify, and the files found in the original scheme are used for attack attempts. Finally, it is difficult to obtain the corresponding signature in the modified verification formula, and the attack difficulty is increased.
Majumdar, Aalo. "Security of Post-Quantum Multivariate Blind Signature Scheme: Revisited and Improved." Thesis, 2021. https://etd.iisc.ac.in/handle/2005/5573.
Повний текст джерелаSukhadarshini, Shubhanwita. "A novel blind signature scheme and its variations based on DLP." Thesis, 2012. http://ethesis.nitrkl.ac.in/4115/1/IOCMLB_thesis.pdf.
Повний текст джерелаЧастини книг з теми "Blind signature scheme"
Bleumer, Gerrit. "Chaum Blind Signature Scheme." In Encyclopedia of Cryptography and Security, 199–200. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-1-4419-5906-5_185.
Повний текст джерелаBellés-Muñoz, Marta, and Vanesa Daza. "Chaum Blind Signature Scheme." In Encyclopedia of Cryptography, Security and Privacy, 1–3. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-642-27739-9_1752-1.
Повний текст джерелаOmar, Satyam, Sahadeo Padhye, and Dhananjoy Dey. "Multivariate Partially Blind Signature Scheme." In Lecture Notes in Electrical Engineering, 143–55. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7346-8_13.
Повний текст джерелаPetzoldt, Albrecht, Alan Szepieniec, and Mohamed Saied Emam Mohamed. "A Practical Multivariate Blind Signature Scheme." In Financial Cryptography and Data Security, 437–54. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70972-7_25.
Повний текст джерелаMoldovyan, Alexandr, Nikolay Moldovyan, and Evgenia Novikova. "Blind 384-bit Digital Signature Scheme." In Lecture Notes in Computer Science, 77–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33704-8_7.
Повний текст джерелаRadu, Cristian, René Govaerts, and Joos Vandewalle. "Witness hiding restrictive blind signature scheme." In Crytography and Coding, 283–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0024474.
Повний текст джерелаTraoré, Jacques. "Making unfair a “Fair” blind signature scheme." In Information and Communications Security, 386–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0028494.
Повний текст джерелаWu, Qianhong, Fanguo Zhang, Willy Susilo, and Yi Mu. "An Efficient Static Blind Ring Signature Scheme." In Information Security and Cryptology - ICISC 2005, 410–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11734727_32.
Повний текст джерелаZhang, Yudi, Debiao He, Fangguo Zhang, Xinyi Huang, and Dawei Li. "An Efficient Blind Signature Scheme Based on SM2 Signature Algorithm." In Information Security and Cryptology, 368–84. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71852-7_25.
Повний текст джерелаZhang, Jianhong, Tao Wei, JianYu Zhang, and Wei Zou. "Linkability of a Blind Signature Scheme and Its Improved Scheme." In Computational Science and Its Applications - ICCSA 2006, 262–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11751632_28.
Повний текст джерелаТези доповідей конференцій з теми "Blind signature scheme"
Hu, Chengyu, and Daxing Li. "Ring Blind Signature Scheme." In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007). IEEE, 2007. http://dx.doi.org/10.1109/snpd.2007.221.
Повний текст джерелаZhong, Jun, and Dake He. "ACJT Group Blind Signature Scheme." In 2006 First International Conference on Communications and Networking in China. IEEE, 2006. http://dx.doi.org/10.1109/chinacom.2006.344757.
Повний текст джерелаZhang, Jianhong, Hua Chen, and Qin Geng. "Cryptoanalysis of Certificateless Partially Blind Signature and Proxy Blind Signature Scheme." In 2009 2nd International Congress on Image and Signal Processing (CISP). IEEE, 2009. http://dx.doi.org/10.1109/cisp.2009.5303562.
Повний текст джерелаCui, Wei, Yang Xin, Yixian Yang, and Xinxin Niu. "A New Blind Signature and Threshold Blind Signature Scheme from Pairings." In 2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007). IEEE, 2007. http://dx.doi.org/10.1109/cisw.2007.4425591.
Повний текст джерелаZhang, Jianhong, and Xue Liu. "An Efficient Blind Ring Signature Scheme." In 2010 WASE International Conference on Information Engineering (ICIE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icie.2010.80.
Повний текст джерелаChen, Haibin, Lei Zhang, Junyuan Xie, and Chongjun Wang. "New Efficient Certificateless Blind Signature Scheme." In 2016 IEEE Trustcom/BigDataSE/ISPA. IEEE, 2016. http://dx.doi.org/10.1109/trustcom.2016.0083.
Повний текст джерелаKim, Young-seol, and Jik-hyun Chang. "Provably Secure Proxy Blind Signature Scheme." In 2006 8th IEEE International Symposium on Multimedia. IEEE, 2006. http://dx.doi.org/10.1109/ism.2006.129.
Повний текст джерелаZhang, Jianh, and Shengnan Gao. "Efficient provable certificateless blind signature scheme." In 2010 International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2010. http://dx.doi.org/10.1109/icnsc.2010.5461528.
Повний текст джерелаTang, P. Z., J. F. Yang, and Q. L. Zhang. "A Certificateless Partially Blind Signature Scheme." In The 2015 International Conference on Software Engineering and Information Technology (SEIT2015). WORLD SCIENTIFIC, 2015. http://dx.doi.org/10.1142/9789814740104_0018.
Повний текст джерелаMeisheng, Yu, Wu Xiaojuan, Guan Jian, and Yu Haixia. "A Certificateless Proxy Blind Signature Scheme." In 2009 WRI World Congress on Software Engineering. IEEE, 2009. http://dx.doi.org/10.1109/wcse.2009.136.
Повний текст джерела