Littérature scientifique sur le sujet « Group-based schemes »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Group-based schemes ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Group-based schemes"
Bernardini, Riccardo, Roberto Cesco Fabbro et Roberto Rinaldo. « Group-Based Reduction Schemes for Streaming Applications ». ISRN Communications and Networking 2011 (8 septembre 2011) : 1–10. http://dx.doi.org/10.5402/2011/898254.
Texte intégralGohar, Moneeb, Hind Ahmed M. Alrubaish, Ruba Suliman M. Alowaid et Jin-Ghoo Choi. « Distributed Group-Based Mobility Management Scheme in Wireless Body Area Networks ». Wireless Communications and Mobile Computing 2017 (2017) : 1–11. http://dx.doi.org/10.1155/2017/4180801.
Texte intégralPerera, Maharage Nisansala Sevwandi, et Takeshi Koshiba. « Almost Fully Secured Lattice-Based Group Signatures with Verifier-Local Revocation ». Cryptography 4, no 4 (30 novembre 2020) : 33. http://dx.doi.org/10.3390/cryptography4040033.
Texte intégralAprahamian, Hrayer, Ebru K. Bish et Douglas R. Bish. « Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk ». Stochastic Systems 10, no 4 (décembre 2020) : 361–90. http://dx.doi.org/10.1287/stsy.2019.0059.
Texte intégralMeshram, Chandrashekhar, Agbotiname Lucky Imoize, Amer Aljaedi, Adel R. Alharbi, Sajjad Shaukat Jamal et Sharad Kumar Barve. « An Efficient Electronic Cash System Based on Certificateless Group Signcryption Scheme Using Conformable Chaotic Maps ». Sensors 21, no 21 (23 octobre 2021) : 7039. http://dx.doi.org/10.3390/s21217039.
Texte intégralChen, F. L., et Z. F. Han. « Quantum group signature scheme based on controlled quantum teleportation ». International Journal of Quantum Information 14, no 08 (décembre 2016) : 1650041. http://dx.doi.org/10.1142/s0219749916500416.
Texte intégralAprahamian, Hrayer, Douglas R. Bish et Ebru K. Bish. « Optimal Risk-Based Group Testing ». Management Science 65, no 9 (septembre 2019) : 4365–84. http://dx.doi.org/10.1287/mnsc.2018.3138.
Texte intégralMa, Li Zhen. « Improved VLR Group Signature Based on DTDH Assumption ». Advanced Engineering Forum 6-7 (septembre 2012) : 520–24. http://dx.doi.org/10.4028/www.scientific.net/aef.6-7.520.
Texte intégralKang, Hyung-Woo, et Seok-Joo Koh. « Enhanced group communication in constrained application protocol–based Internet-of-things networks ». International Journal of Distributed Sensor Networks 14, no 4 (avril 2018) : 155014771877279. http://dx.doi.org/10.1177/1550147718772793.
Texte intégralCao, Liling, Mei Liang, Zheng Zhang et Shouqi Cao. « Certificateless Cross-Domain Group Authentication Key Agreement Scheme Based on ECC ». Wireless Communications and Mobile Computing 2022 (5 décembre 2022) : 1–16. http://dx.doi.org/10.1155/2022/7519688.
Texte intégralThèses sur le sujet "Group-based schemes"
Ji, Hui. « Study and optimization of new differential space-time modulation schemes based on the Weyl group for the second generation of MIMO systems ». Thesis, Rennes, INSA, 2015. http://www.theses.fr/2015ISAR0021/document.
Texte intégralAt present, the study of multi-antenna systems MIMO (Multiple Input Multiple Output) is developed in many cases to intensively increase the number of base station antennas («massive MIMO», «largescale MIMO»), particularly in order to increase the transmission capacity, reduce energy consumed per bit transmitted, exploit the spatial dimension of the propagation channel, reduce the influence of fading, etc. For MIMO systems with narrowband or those using OFDM technique (Orthogonal Frequency Division Multiplex), the propagation channel (or the sub-channels corresponding to each sub-carrier of an OFDM system) are substantially flat (frequency non-selective). In this case the frequency response of each SISO channel is invariant with respect to frequency, but variant in time. Furthermore, the MIMO propagation channel can be characterized in baseband by a matrix whose coefficients are complex numbers. Coherent MIMO systems need to have the knowledge of the channel matrix to be able to demodulate the received signal. Therefore, periodic pilot should be transmitted and received to estimate the channel matrix in real time. The increase of the number of antennas and the change of the propagation channel over time, sometimes quite fast, makes the channel estimation quite difficult or impossible. It is therefore interesting to study differential MIMO systems that do not need to know the channel matrix. For proper operation of these systems, the only constraint is that the channel matrix varies slightly during the transmission of two successive information matrices. The subject of this thesis is the study and analysis of new differential MIMO systems. We consider systems with 2, 4 and 8 transmit antennas, but the method can be extended to MIMO systems with 2n transmit antennas, the number of receive antennas can be any positive integer. For MIMO systems with two transmit antennas that were studied in this thesis, information matrices are elements of the Weyl group. For systems with 2n (n ≥ 2) transmit antennas, the matrices used are obtained by performing the Kronecker product of the unitary matrices in Weyl group. For each number of transmit antennas, we first identify the number of available matrices and the maximum value of the spectral efficiency. For each value of the spectral efficiency, we then determine the best subsets of information matrix to use (depending on the spectrum of the distances or the diversity product criterion). Then we optimize the correspondence or mapping between binary vectors and matrices of information. Finally, the performance of differential MIMO systems are obtained by simulation and compared with those of existing similar systems. […]
Ferrari, Nico. « Context-Based Authentication and Lightweight Group Key Establishment Protocol for IoT Devices ». Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-36975.
Texte intégralRoman-Moreno, Francisco J. « Effects of a group performance-based incentive scheme on labor productivity, product quality, and organizational performance ». Diss., The University of Arizona, 2003. http://hdl.handle.net/10150/280327.
Texte intégralMapoka, Trust Tshepo. « Location based authenticated multi-services group key management for cyber security in high speed broadband wireless multicast communications : multi-service group key management scheme with location based handover authentication for multi-handoffs participating in multi-group service subscriptions, its performance evaluation and security correctness in high speed broadband wireless multicast communications ». Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/14468.
Texte intégralDoll, Dominik [Verfasser], Alwine [Akademischer Betreuer] [Gutachter] Mohnen et Eberhard [Gutachter] Feess. « Enhancement of corporate decision making – Three essays on ability-based group composition, assessment criteria for payment scheme efficiency, and factors for employee pay satisfaction / Dominik Doll ; Gutachter : Alwine Mohnen, Eberhard Feess ; Betreuer : Alwine Mohnen ». München : Universitätsbibliothek der TU München, 2016. http://d-nb.info/1116604388/34.
Texte intégralDoll, Dominik Verfasser], Alwine [Akademischer Betreuer] [Mohnen et Eberhard [Gutachter] Feess. « Enhancement of corporate decision making – Three essays on ability-based group composition, assessment criteria for payment scheme efficiency, and factors for employee pay satisfaction / Dominik Doll ; Gutachter : Alwine Mohnen, Eberhard Feess ; Betreuer : Alwine Mohnen ». München : Universitätsbibliothek der TU München, 2016. http://nbn-resolving.de/urn:nbn:de:bvb:91-diss-20160916-1307222-1-4.
Texte intégralLee, Jun-Qi, et 李俊祺. « Group-Based Load Balance Schemes for Software Distributed Shared Memory Systems ». Thesis, 2000. http://ndltd.ncl.edu.tw/handle/66942882870091045967.
Texte intégral國立成功大學
電機工程學系
88
Load balancing is an important issue for the performance of software distributed shared memory (DSM) systems. One solution of addressing this issue is exploiting dynamic thread migration. In order to reduce the data consistency communication increased by thread migration, the previous load balance schemes carefully chose threads for workload migration. However, they usually considered only the threads on the heaviest loaded node and the lightest loaded node for each decision of thread migration. Therefore, the choices of thread migration and the effectiveness of communication minimization are limited to the lightest loaded node and the heaviest loaded node. To attack this problem, three group-based load balance schemes, i.e., multiple senders plus single receiver, single sender plus multiple receivers, and multiple senders plus multiple receivers, are proposed for DSM systems in this thesis. The main characteristic of them is to classify the overloaded nodes and the lightly loaded nodes into a sender group and a receiver group, and then consider all the threads of the sender group and/or all the nodes of the receiver group for each decision. They have been implemented on a page-based system called Cohesion. The experimental results show that the group-based schemes reduce more data-consistency communication than the previous schemes, and the scheme of multiple senders plus multiple receivers is superior to all the other schemes in communication minimization. Besides, this thesis also resolves the problem of the high costs caused by group-based schemes. Therefore, the performance of the test programs is effectively enhanced after minimizing the data consistency communication increased by thread migration.
Chang, Pen-Yi, et 張本毅. « Group Signature and Key Agreement Schemes Based on Diffie-Hellman Key Exchange Protocol ». Thesis, 2006. http://ndltd.ncl.edu.tw/handle/00699887042168121766.
Texte intégral國立中正大學
資訊工程所
94
Since the network is prospering, our life becomes more and more convenient. We can do many things through network. However, network environment is often insecure and can be eavesdropped easily. So, we need to provide at least two requirements of information transmitted on network: security and integrity. We can fulfill the two requirements by encrypting and signing the information transmitted on network. In this paper, we propose a novel group signature scheme which is efficient and the length of signature is independent on the member numbers of the group. Moreover, to make wireless sensor network more suitable in practical use, researchers have to develop an efficient method to ensure secure data transmission through sensor nodes. Therefore, we propose a novel key agreement scheme which can ensure that any pair of node can securely negotiate one session key, and its required computational overheads are acceptable because the scheme is based on Bilinear Pairing and Gap Diffie-Hellman Group. Finally, to prevent the leak of information in network meeting, we propose a collaborative conference key agreement scheme based on Diffie-Hellman Key Exchange Protocol.
Mahmoud, Mahmoud Yehia Ahmed. « Secure and efficient post-quantum cryptographic digital signature algorithms ». Thesis, 2021. http://hdl.handle.net/1828/13307.
Texte intégralGraduate
Chang, Tin-Wei, et 張廷瑋. « Efficient Authentication Schemes Based on Group Certificate and Their Applications on Mobile Communication System ». Thesis, 2003. http://ndltd.ncl.edu.tw/handle/10164050032178886593.
Texte intégral國立成功大學
電機工程學系碩博士班
91
User authentication is one of the most important applications in cryptography. For example, the passage management of the building or the virtual network services all need secure and efficient user authentication. The most common user authentication process in our daily life is the authentication protocol in mobile communication system. With the popularization of cellular phones, the security of mobile systems becomes more and more critical. In the early days, when the first generation mobile system was started, the user authentication protocol was not conscientious and careful. The misappropriation problem is very serious; the users and the telecommunication companies suffered large amount of damage. After the cryptography technology was applied to the authentication protocol in second generation mobile communication system, the situation became better. The mobile systems nowadays have moved from second generation to third generation, and the security requirements of next generation system are very different. With the growth of computing power of mobile devices, many new authentication protocols based on public key cryptography have been proposed recently. Since the computation required for public key computation is large compared with the symmetric key encryption, the efficiency consideration is very important. In this thesis, we propose a new digital signature scheme, which has single public key corresponding to multiple private keys. With this novel property, we can construct a group certificate for a group of users. The users in the same group hold the same certificate in spite of the different users hold the different secret keys. The public key is the same for all users in the same group. The group certificate has much benefit in authentication protocols, such as saving storage spaces and reducing the need of exchanging certificates. Because only one certificate is needed for a group of users, the efficiency will be improved. However, the group certificate is not like the group oriented cryptography technology. With our group certificate, not only the group but also the specific user in the group can be authenticated. We first propose the method, and show that it is very suitable for both group and user authentications.
Livres sur le sujet "Group-based schemes"
Camenisch, Jan. Group signature schemes and payment systems based on the discrete logarithm problem. Konstanz : Hartung-Gorre-Verlag, 1998.
Trouver le texte intégralOketch, Henry Oloo. A diagnostic survey of the workings of group-based lending : The case of K-REP's Juhudi credit scheme-Kibera. Nairobi : Kenya Rural Enterprise Programme, Research, Monitoring and Evaluation Dept., 1992.
Trouver le texte intégralWit, Margareth. Making Shift Happen. Traduit par Jonathan Hills. NL Amsterdam : Amsterdam University Press, 2021. http://dx.doi.org/10.5117/9789463720267.
Texte intégralTang, Man-Chung. The Story of the Koror Bridge. Zurich, Switzerland : International Association for Bridge and Structural Engineering (IABSE), 2014. http://dx.doi.org/10.2749/cs001.
Texte intégralDiGirolamo, Vincent. Crying the News. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780195320251.001.0001.
Texte intégralHalliday, Daniel. Inheritance of Wealth. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198803355.001.0001.
Texte intégralKropf, Nancy P., et Sherry M. Cummings. Cognitive Behavioral Therapy. Oxford University Press, 2017. http://dx.doi.org/10.1093/acprof:oso/9780190214623.003.0003.
Texte intégralSpain, Debbie, Francisco M. Musich et Susan W. White. Psychological Therapies for Adults with Autism. Oxford University Press, 2022. http://dx.doi.org/10.1093/med-psych/9780197548462.001.0001.
Texte intégralWatts, Richard A., et David G. I. Scott. Vasculitis—classification and diagnosis. Oxford University Press, 2013. http://dx.doi.org/10.1093/med/9780199642489.003.0130.
Texte intégralMeijers, Tim. Justice Between Generations. Oxford University Press, 2018. http://dx.doi.org/10.1093/acrefore/9780190228637.013.233.
Texte intégralChapitres de livres sur le sujet "Group-based schemes"
Canard, Sébastien, et Jacques Traoré. « On Fair E-cash Systems Based on Group Signature Schemes ». Dans Information Security and Privacy, 237–48. Berlin, Heidelberg : Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45067-x_21.
Texte intégralPerera, Maharage Nisansala Sevwandi, et Takeshi Koshiba. « Zero-Knowledge Proof for Lattice-Based Group Signature Schemes with Verifier-Local Revocation ». Dans Advances in Network-Based Information Systems, 772–82. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98530-5_68.
Texte intégralNuida, Koji. « Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory ». Dans International Symposium on Mathematics, Quantum Theory, and Cryptography, 57–78. Singapore : Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_8.
Texte intégralVasco, María Isabel González, Consuelo Martínez, Rainer Steinwandt et Jorge L. Villar. « A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes ». Dans Theory of Cryptography, 495–509. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30576-7_27.
Texte intégralZhang, Yanhua, Ximeng Liu, Yupu Hu, Qikun Zhang et Huiwen Jia. « Cryptanalysis of Two Fully Anonymous Attribute-Based Group Signature Schemes with Verifier-Local Revocation from Lattices ». Dans Information Security Applications, 334–46. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65299-9_25.
Texte intégralTanaka, Kazuyuki. « Review of Sublinear Modeling in Probabilistic Graphical Models by Statistical Mechanical Informatics and Statistical Machine Learning Theory ». Dans Sublinear Computation Paradigm, 165–275. Singapore : Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-4095-7_10.
Texte intégralJiang, An Nan. « Analyzing the Strength and Stability of Large Underground Cavern Group with Different Generator Socket Construction Schemes Based on Three Dimensional Numerical Simulation ». Dans Key Engineering Materials, 2537–40. Stafa : Trans Tech Publications Ltd., 2007. http://dx.doi.org/10.4028/0-87849-456-1.2537.
Texte intégralMa, Chunbo, et Jun Ao. « Group-Based Proxy Re-encryption Scheme ». Dans Emerging Intelligent Computing Technology and Applications, 1025–34. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04070-2_108.
Texte intégralAleksandrova, Elena, Olga Pendrikova, Anna Shtyrkina, Elena Shkorkina, Anastasya Yarmak et József Tick. « Threshold Isogeny-Based Group Authentication Scheme ». Dans Algorithms and Solutions Based on Computer Technology, 117–26. Cham : Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-93872-7_10.
Texte intégralAnastasia, Yarmak. « Isogeny-Based Group Key Establishment Scheme ». Dans Intelligent Sustainable Systems, 107–17. Singapore : Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-7663-6_11.
Texte intégralActes de conférences sur le sujet "Group-based schemes"
Abla, Parhat. « Lattice Based Group Key Exchange Protocol in the Standard Model ». Dans 2nd International Conference on Machine Learning &Trends (MLT 2021). AIRCC Publishing Corporation, 2021. http://dx.doi.org/10.5121/csit.2021.111113.
Texte intégralJyostna, K., B. N. Bhandari et Swathi Roja. « Performance analysis of Group based Cooperative Sensing Schemes ». Dans 2016 2nd International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT). IEEE, 2016. http://dx.doi.org/10.1109/icatcct.2016.7912006.
Texte intégralChaabane, Faten, Maha Charfeddine et Chokri Ben Amar. « Clustering impact on group-based traitor tracing schemes ». Dans 2015 15th International Conference on Intelligent Systems Design and Applications (ISDA). IEEE, 2015. http://dx.doi.org/10.1109/isda.2015.7489270.
Texte intégralPorkodi, C., et R. Arumuganathan. « Group-oriented signature schemes based on Chinese remainder theorem ». Dans 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC). IEEE, 2009. http://dx.doi.org/10.1109/nabic.2009.5393640.
Texte intégralSakai, H., et H. Yamamoto. « Asymptotic optimality of tree-based group key management schemes ». Dans Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. IEEE, 2005. http://dx.doi.org/10.1109/isit.2005.1523753.
Texte intégralArikan, Abdurrahman, Yuexin Mao, Xiaolan Zhang, Bing Wang, Shengli Zhou et Song Han. « Network coding based transmission schemes in DTNs with group meetings ». Dans 2015 IEEE 34th International Performance Computing and Communications Conference (IPCCC). IEEE, 2015. http://dx.doi.org/10.1109/pccc.2015.7410273.
Texte intégralPark, Haeryong, Hyun Kim, Kilsoo Chun, Jaeil Lee, Seongan Lim et Ikkwon Yie. « Untraceability of Group Signature Schemes based on Bilinear Mapping and Their Improvement ». Dans 2007 4th International Conference on Information Technology New Generations. IEEE, 2007. http://dx.doi.org/10.1109/itng.2007.199.
Texte intégralXu, Shouhuai. « On the security of group communication schemes based on symmetric key cryptosystems ». Dans the 3rd ACM workshop. New York, New York, USA : ACM Press, 2005. http://dx.doi.org/10.1145/1102219.1102224.
Texte intégralFerr, G., J. P. Cances et V. Meghdadi. « New Layered Space-Time Schemes Based on Group of Three Transmit Antenna ». Dans 2008 6th Annual Communication Networks and Services Research Conference (CNSR). IEEE, 2008. http://dx.doi.org/10.1109/cnsr.2008.68.
Texte intégralKrishna, M. Bala. « Group-based incentive and penalizing schemes for proactive participatory data sensing in IoT networks ». Dans 2018 IEEE 4th World Forum on Internet of Things (WF-IoT). IEEE, 2018. http://dx.doi.org/10.1109/wf-iot.2018.8355208.
Texte intégralRapports d'organisations sur le sujet "Group-based schemes"
Benson, Vivienne, et Jenny C. Aker. Improving Adult Literacy in Niger Through Mobile Calls to Teachers. Institute of Development Studies and The Impact Initiative, février 2021. http://dx.doi.org/10.35648/20.500.12413/11781/ii368.
Texte intégralJordan, Ramon L., Abed Gera, Hei-Ti Hsu, Andre Franck et Gad Loebenstein. Detection and Diagnosis of Virus Diseases of Pelargonium. United States Department of Agriculture, juillet 1994. http://dx.doi.org/10.32747/1994.7568793.bard.
Texte intégralMcPhedran, R., K. Patel, B. Toombs, P. Menon, M. Patel, J. Disson, K. Porter, A. John et A. Rayner. Food allergen communication in businesses feasibility trial. Food Standards Agency, mars 2021. http://dx.doi.org/10.46756/sci.fsa.tpf160.
Texte intégral