Relevant bibliographies by topics / Authentication and secret sharing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Authentication and secret sharing'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

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 'Authentication and secret sharing.'

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 "Authentication and secret sharing"

1

Choudhary, Shipra PraveenKumar, Apeksha Katarni, Shweta Manjrekar, Mrs Vidyullata Devmane, and Mrs Vaishali Hirlekar. "Secret Sharing Approach in Multi-database System." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 6 (April 20, 2016): 6819–23. http://dx.doi.org/10.24297/ijct.v15i6.1606.

Full text
Abstract:
Secret sharing schemes are ideal for storing highly sensitive data. A secret is divided into many parts and every participant gets his unique part. If we combine all of these parts and try regenerating the secret then it might be impractical, and therefore the threshold scheme is used. Shamir’s secret sharing scheme supports the same. Here, some of the parts or all of them are required to reconstruct the secret. Any threshold number of parts are sufficient to reconstruct the original secret. The Admin has a set of files which are confidentiality and availability of data. Whenever a Client requests to access the files, the Admin performs authentication of the user through an encrypted and stored on multiple databases so as to achieve Authentication module, who makes use if Shamir's secret sharing concept. This is similar to the One Time Password (OTP) mechanism. If the Client is authentic, Admin grants him the decryption key and the Client can access the file. In this paper, we shall discuss all this in detail using which we can provide security, replication of data and authentication.Â
APA, Harvard, Vancouver, ISO, and other styles
2

S.Patil, Rupali, Sonali Patil, and Sudeep D. Thepade. "Secret Sharing based Secure Authentication System." International Journal of Computer Applications 118, no. 22 (May 20, 2015): 8–11. http://dx.doi.org/10.5120/20875-3613.

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

Sirdeshpande, Janhavi, and Sonali Patil. "Amended Biometric Authentication using Secret Sharing." International Journal of Computer Applications 98, no. 21 (July 18, 2014): 28–32. http://dx.doi.org/10.5120/17308-7770.

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

Sun Ying, Du Jian-Zhong, Qin Su-Juan, Wen Qiao-Yan, and Zhu Fu-Chen. "Quantum secret sharing with bidirectional authentication." Acta Physica Sinica 57, no. 8 (2008): 4689. http://dx.doi.org/10.7498/aps.57.4689.

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

Tu, Shu-Fen, Ching-Sheng Hsu, and Fu-Hsing Wang. "Application of Threshold Secret Sharing to Image Authentication and Recovery." SIJ Transactions on Computer Science Engineering & its Applications (CSEA) 01, no. 05 (December 2, 2013): 32–38. http://dx.doi.org/10.9756/sijcsea/v1i5/0104640402.

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

Bezzateev, Sergey, Vadim Davydov, and Aleksandr Ometov. "On Secret Sharing with Newton’s Polynomial for Multi-Factor Authentication." Cryptography 4, no. 4 (December 1, 2020): 34. http://dx.doi.org/10.3390/cryptography4040034.

Full text
Abstract:
Security and access control aspects are becoming more and more essential to consider during the design of various systems and the tremendous growth of digitization. One of the related key building blocks in this regard is, essentially, the authentication process. Conventional schemes based on one or two authenticating factors can no longer provide the required levels of flexibility and pro-activity of the access procedures, thus, the concept of threshold-based multi-factor authentication (MFA) was introduced, in which some of the factors may be missing, but the access can still be granted. In turn, secret sharing is a crucial component of the MFA systems, with Shamir’s schema being the most widely known one historically and based on Lagrange interpolation polynomial. Interestingly, the older Newtonian approach to the same problem is almost left without attention. At the same time, it means that the coefficients of the existing secret polynomial do not need to be re-calculated while adding a new factor. Therefore, this paper investigates this known property of Newton’s interpolation formula, illustrating that, in specific MFA cases, the whole system may become more flexible and scalable, which is essential for future authentication systems.
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Chang-Chou, and Wen-Hsiang Tsai. "Secret image sharing with steganography and authentication." Journal of Systems and Software 73, no. 3 (November 2004): 405–14. http://dx.doi.org/10.1016/s0164-1212(03)00239-5.

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

Arafin, Md Tanvir, and Gang Qu. "Memristors for Secret Sharing-Based Lightweight Authentication." IEEE Transactions on Very Large Scale Integration (VLSI) Systems 26, no. 12 (December 2018): 2671–83. http://dx.doi.org/10.1109/tvlsi.2018.2823714.

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

Jiang, Yue, Xuehu Yan, Jianqing Qi, Yuliang Lu, and Xuan Zhou. "Secret Image Sharing with Dealer-Participatory and Non-Dealer-Participatory Mutual Shadow Authentication Capabilities." Mathematics 8, no. 2 (February 12, 2020): 234. http://dx.doi.org/10.3390/math8020234.

Full text
Abstract:
A ( k , n ) threshold secret image sharing (SIS) method is proposed to divide a secret image into n shadows. The beauty of this scheme is that one can only reconstruct a secret image with k or more than k shadows, but one cannot obtain any information about the secret from fewer than k shadows. In the ( k , n ) threshold SIS, shadow authentication means the detection and location of manipulated shadows. Traditional shadow authentication schemes require additional bits for authentication; need much information to be public; or need to put each shadow into a host image, utilizing the information hiding technique, which makes the generation, recovery and authentication complexity higher. Besides, most existing schemes work when a dealer participates in recovery. Our contribution is that we propose a SIS method for a ( k , n ) threshold with dealer-participatory and non-dealer-participatory mutual shadow authentication capabilities which integrates polynomial-based SIS and visual secret sharing (VSS) through using the result of VSS to “guide” the polynomial-based SIS by a screening operation. In our scheme, when an authentication image is public, all involved actors (participants and dealer) can mutually authenticate each other by exchange the lowest level plane instead of the whole shadow. Our scheme is suitable for the case with and without a dealer participate recovery. In addition, the proposed scheme has characteristics of low generation and authentication complexity, no pixel expansion, 100% detection rate and lossless recovery.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhu, Yuesheng, Bojun Wang, and Cheng Cai. "A Novel Smart-Card Based Authentication Scheme Using Proactive Secret Sharing." International Journal of Computer and Communication Engineering 5, no. 3 (2016): 196–205. http://dx.doi.org/10.17706/ijcce.2016.5.3.196-205.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Authentication and secret sharing"

1

Miceli, Christopher. "One Time Password Scheme Via Secret Sharing Techniques." ScholarWorks@UNO, 2011. http://scholarworks.uno.edu/td/1330.

Full text
Abstract:
Many organizations today are seeking to improve security by implementing multi-factor authentication, i.e. authentication requiring more than one independent mechanism to prove one's identity. One-time passwords in the form of hardware tokens in combination with conventional passwords have emerged as the predominant means in high security environments to satisfy the independent identification criteria for strong authentication. However, current popular public one-time passwords solutions such as HOTP, mOTP, TOTP, and S/Key depend on the computational complexity of breaking encryption or hash functions for security. This thesis will present an efficient and information-theoretically secure one-time password system called Shamir-OTP that is based upon secret sharing techniques.
APA, Harvard, Vancouver, ISO, and other styles
2

Al-Adhami, Ayad. "A secure quorum based multi-tag RFID system." Thesis, University of Plymouth, 2018. http://hdl.handle.net/10026.1/12821.

Full text
Abstract:
Radio Frequency Identification (RFID) technology has been expanded to be used in different fields that need automatic identifying and verifying of tagged objects without human intervention. RFID technology offers a great advantage in comparison with barcodes by providing accurate information, ease of use and reducing of labour cost. These advantages have been utilised by using passive RFID tags. Although RFID technology can enhance the efficiency of different RFID applications systems, researchers have reported issues regarding the use of RFID technology. These issues are making the technology vulnerable to many threats in terms of security and privacy. Different RFID solutions, based on different cryptography primitives, have been developed. Most of these protocols focus on the use of passive RFID tags. However, due to the computation feasibility in passive RFID tags, these tags might be vulnerable to some of the security and privacy threats. , e.g. unauthorised reader can read the information inside tags, illegitimate tags or cloned tags can be accessed by a reader. Moreover, most consideration of reserchers is focus on single tag authentication and mostly do not consider scenarios that need multi-tag such as supply chain management and healthcare management. Secret sharing schemes have been also proposed to overcome the key management problem in supply chain management. However, secret sharing schemes have some scalability limitations when applied with high numbers of RFID tags. This work is mainly focused on solving the problem of the security and privacy in multi-tag RFID based system. In this work firstly, we studied different RFID protocols such as symmetric key authentication protocols, authentication protocols based on elliptic curve cryptography, secret sharing schemes and multi-tag authentication protocols. Secondly, we consider the significant research into the mutual authentication of passive RFID tags. Therefore, a mutual authentication scheme that is based on zero-knowledge proof have been proposed . The main object of this work is to develop an ECC- RFID based system that enables multi-RFID tags to be authenticated with one reader by using different versions of ECC public key encryption schemes. The protocol are relied on using threshold cryptosystems that operate ECC to generate secret keys then distribute and stored secret keys among multi RFID tags. Finally, we provide performance measurement for the implementation of the proposed protocols.
APA, Harvard, Vancouver, ISO, and other styles
3

Adeka, Muhammad I. "Cryptography and Computer Communications Security. Extending the Human Security Perimeter through a Web of Trust." Thesis, University of Bradford, 2015. http://hdl.handle.net/10454/11380.

Full text
Abstract:
This work modifies Shamir’s algorithm by sharing a random key that is used to lock up the secret data; as against sharing the data itself. This is significant in cloud computing, especially with homomorphic encryption. Using web design, the resultant scheme practically globalises secret sharing with authentications and inherent secondary applications. The work aims at improving cybersecurity via a joint exploitation of human factors and technology; a human-centred cybersecurity design as opposed to technology-centred. The completed functional scheme is tagged CDRSAS. The literature on secret sharing schemes is reviewed together with the concepts of human factors, trust, cyberspace/cryptology and an analysis on a 3-factor security assessment process. This is followed by the relevance of passwords within the context of human factors. The main research design/implementation and system performance are analysed, together with a proposal for a new antidote against 419 fraudsters. Two twin equations were invented in the investigation process; a pair each for secret sharing and a risk-centred security assessment technique. The building blocks/software used for the CDRSAS include Shamir’s algorithm, MD5, HTML5, PHP, Java, Servlets, JSP, Javascript, MySQL, JQuery, CSS, MATLAB, MS Excel, MS Visio, and Photoshop. The codes are developed in Eclipse IDE, and the Java-based system runs on Tomcat and Apache, using XAMPP Server. Its code units have passed JUnit tests. The system compares favourably with SSSS. Defeating socio-cryptanalysis in cyberspace requires strategies that are centred on human trust, trust-related human attributes, and technology. The PhD research is completed but there is scope for future work.
APA, Harvard, Vancouver, ISO, and other styles
4

Reyzin, Alissa Natanovna. "Rational secret sharing." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/46511.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 59-60).
Recent work has attempted to bridge the fields of Cryptography and Game Theory in order to create more robust protocols that allow for a variety of player types. A keystone functionality used in cryptography is Secret Sharing. While there are several well known, efficient protocols that implement Secret Sharing in the Cryptographic model, designing a Rational Secret Sharing protocol which works in the Game Theoretic model has proved challenging. In this thesis, we contrast several recently proposed protocols for Rational Secret Sharing based on their channel models, utility tolerances, equilibrium types, and efficiencies. We also discuss two more general results bridging Cryptography and Game Theory that can be used to construct Rational Secret Sharing protocols. Finally, we highlight several issues of context that influence the ways in which Rational Secret Sharing protocols might be used.
by Alissa Natanovna Reyzin.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
5

Farràs, Ventura Oriol. "Multipartite secret sharing schemes." Doctoral thesis, Universitat Politècnica de Catalunya, 2010. http://hdl.handle.net/10803/77919.

Full text
Abstract:
This thesis is dedicated to the study of secret sharing schemes, which are cryptographic methods to share information in a secure way. The topics that are considered in the thesis are two of the main open problems in secret sharing: the characterization of the ideal access structures and the optimization of the length of the shares for general access structures. These open problems are studied for multipartite secret sharing schemes. In these schemes the set of participants is divided into parts and the participants in each part have the same rights to obtain the secret. The results of the thesis are based on a new combinatorial property of secret sharing schemes, which is a connection between ideal multipartite secret sharing schemes and integer polymatroids. It provides new sufficient conditions and necessary conditions for an access structure to be ideal. Moreover, this connection is also used in the construction ideal linear multipartite secret sharing schemes. These results are useful for the study of multipartite access structures in which the number of parts is small in relation to the number of participants, and multipartite access structures in which the parts are related in a special way. This is the case of the family of hierarchical access structures, which are the ones in which the participants can be hierarchically ordered, and the family of tripartite access structures. Applying these results, the ideal access structures in these families are completely characterized. All the ideal multipartite secret sharing schemes presented in the literature are related to a particular family of integer polymatroids, the boolean ones. The analysis of these polymatroids leds to the find of new ideal multipartite secret sharing schemes. The optimization of the length of the shares is also studied for multipartite secret sharing schemes, in particular for the bipartite ones. The main results are a new method to find bound on the length of the shares that combines linear
El tema d'aquesta tesi són els esquemes de compartició de secrets, uns mètodes criptogràfics que permeten fragmentar missatges de manera segura. En particular s'aborden dos dels principals problemes oberts en aquest camp: la caracterització de les estructures d'accés que admeten esquemes de compartició de secrets ideals i l'optimització de la llargada dels fragments en construccions per estructures d'accés generals. Aquests problemes oberts s'estudien per estructures d'accés multipartides, que són estructures en què el conjunt de participants està dividit en diferents parts i a cada part tots els participants tenen el mateix rol. Aquest plantejament resulta útil per estudiar famílies d'estructures d'accés en què el nombre de parts és petit i estructures en què hi ha alguna relació especial entre les parts, com les jeràrquiques i les compartmentades. L'eina principal d'aquest estudi és una nova propietat de les estructures ideals que es presenta en aquesta tesi, una connexió entre les estructures ideals multipartides i els polimatroides enters. A partir d'aquesta connexió s'obté una condició suficient i una de necessària perquè una estructura d'accés multipartida sigui ideal. Així, aquesta connexió permet discutir la idealitat de les estructures d'accés i també, en el cas que el polimatoride sigui representable, construir esquemes ideals a partir de les representacions. Aplicant aquests resultats s'obté un nou marc per descriure i analitzar mètodes per construir esquemes multipartits ideals. Com a resultat d'aquest estudi s'obté una caracterització completa de les estructures d'accés tripartides ideals i de les jeràrquiques ideals. Una estructura és jeràrquica si el conjunt de participants es pot ordenar de tal manera que si en un conjunt autoritzat es canvia un participant per un de jeràrquicament superior, el nou conjunt també és autoritzat. A partir d'aquest resultat s'obté una nova caracterització de les estructures de llindar amb pesos ideals. Després d'analitzar tots els esquemes de compartició de secrets ideals multipartits presentats fins l'actualitat, es mostra que tots ells estan relacionats amb una família molt senzilla de polimatroides enters, els booleans. A partir d'aquests polimatroides s'obté una nova família d'estructures ideals, les compartmentades, que inclouen diverses famílies estudiades prèviament. L'altre problema obert considerat a la tesi, l'estudi de l'optimització de la llargada dels fragments, es centra en les estructures bipartides. Combinant tècniques de programació lineal i polimatroides, es presenta un mètode per calcular fites en la llargada dels fragments per estructures d'accés no ideals que és vàlid per qualsevol estructura multipartida. A partir de tècniques algebraiques es presenten noves fites i una família d'esquemes bipartits òptims.
APA, Harvard, Vancouver, ISO, and other styles
6

Schultz, David Andrew. "Mobile Proactive secret sharing." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40535.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
MIT Barker Engineering Library copy: issued in leaves.
Includes bibliographical references (p. 153-157).
This thesis describes mobile proactive secret sharing (MPSS), an extension of proactive secret sharing. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareholders being exactly the same from one epoch to the next, we allow the group to change arbitrarily. In addition, we allow for an increase or decrease of the threshold at each epoch. We give the first known efficient protocol for MPSS in the asynchronous network model. We present this protocol as a practical solution to the problem of long-term protection of a secret in a realistic network.
by David Andrew Schultz.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Dryjanski, David. "Practical Mobile Proactive Secret Sharing." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45993.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 59-60).
Secret sharing schemes are needed to store and protect secrets in large scale distributed systems. These schemes protect a secret by dividing the it into shares and distributing the shares to multiple shareholders. This way the compromise of a single shareholder does not reveal the secret. Many new secret sharing schemes, such as Proactive Secret Sharing, have been developed to combat the increasing threat from malicious nodes and keep systems secure. However, most of these schemes can be compromised over time, since share transfer and redistribution are static: the set of shareholders is fixed. Mobile Proactive Secret Sharing (MPSS) is a new protocol with dynamic redistribution that can adapt to Byzantine faults and remain secure for the duration of long-lived systems. This thesis describes the simulation, testing, and evaluation of the MPSS protocol to better understand the performance trade-offs and practicality of secret sharing protocols operating in Byzantine faulty environments. The thesis evaluates the original MPSS scheme and the MPSS scheme with verifiable accusations in a distributed setting, finds that both schemes are practical, and explores the performance trade-offs between the two schemes.
by David Dryjanski.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
8

Johansson, Håkan. "Secret Sharing with Threshold Schemes." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-97619.

Full text
Abstract:
In this thesis, four different methods for secret sharing with threshold schemes will be investigated. We will discuss theory, implementation and security aspects. For example, we show how some known attacks are implemented.The methods considered in this thesis, are the schemes by Shamir, Blakley, Mignotte and Asmuth-Bloom.
APA, Harvard, Vancouver, ISO, and other styles
9

Yuan, Jin. "Secret sharing schemes from linear codes /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20YUAN.

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

Alkharobi, Talal M. "Secret sharing using artificial neural network." Diss., Texas A&M University, 2004. http://hdl.handle.net/1969.1/1223.

Full text
Abstract:
Secret sharing is a fundamental notion for secure cryptographic design. In a secret sharing scheme, a set of participants shares a secret among them such that only pre-specified subsets of these shares can get together to recover the secret. This dissertation introduces a neural network approach to solve the problem of secret sharing for any given access structure. Other approaches have been used to solve this problem. However, the yet known approaches result in exponential increase in the amount of data that every participant need to keep. This amount is measured by the secret sharing scheme information rate. This work is intended to solve the problem with better information rate.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Authentication and secret sharing"

1

Mothers talking: Sharing the secret. New York: St. Martin's Press, 1986.

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

Visual cryptography and secret image sharing. Boca Raton, FL: Taylor & Francis, 2011.

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

Crary, Elizabeth. The secret of toddler sharing: Why sharing is hard and how to make it easier. Seattle, Wash: Parenting Press, 2013.

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

Sharing secrets with Stalin: How the Allies traded intelligence, 1941-1945. [Lawrence, Kan.]: University Press of Kansas, 1996.

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

Sharing the secret: The history of the Intelligence Corps, 1940 - 2010. Barnsley, South Yorkshire: Pen & Sword Military, 2013.

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

Smith, Michal. Aladdin's magic: The company's magic is no secret : communicating, sharing information are keys to success. [Washington, D.C: U.S. Dept. of Labor, Bureau of Labor-Management Relations and Cooperative Programs, 1988.

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

Myasnikov, Alexei G. Non-commutative cryptography and complexity of group-theoretic problems. Providence, R.I: American Mathematical Society, 2011.

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

Emmett, Jonathan. Secret Worth Sharing. Walker & Company, 2011.

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

Emmett, Jonathan. A Secret Worth Sharing. Walker Books Ltd, 2017.

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

Burck, Frances Wells. Mothers Talking: Sharing the Secret. St Martins Pr, 1987.

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

Book chapters on the topic "Authentication and secret sharing"

1

Nag, Amitava, Sushanta Biswas, Debasree Sarkar, and Partha Pratim Sarkar. "Image Secret Sharing in Stego-Images with Authentication." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 764–70. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-37949-9_66.

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

Xu, Rui, Kirill Morozov, and Tsuyoshi Takagi. "Cheater Identifiable Secret Sharing Schemes via Multi-Receiver Authentication." In Advances in Information and Computer Security, 72–87. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09843-2_6.

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

Sanyasi Naidu, P., and Reena Kharat. "Secure Authentication in Online Voting System Using Multiple Image Secret Sharing." In Communications in Computer and Information Science, 336–43. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-2738-3_29.

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

Manasi, Jana, and Jana Biswapati. "Authentication on Interpolated Subsampled Based Image Steganography Exploiting Secret Sharing." In Advances in Intelligent Systems and Computing, 681–90. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7834-2_63.

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

Kikuchi, Ryo, Koji Chida, Dai Ikarashi, and Koki Hamada. "Practical Password-Based Authentication Protocol for Secret Sharing Based Multiparty Computation." In Cryptology and Network Security, 179–96. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26823-1_13.

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

Mohamed Fathimal, P., and P. Arockia Jansi Rani. "K Out of N Secret Sharing Scheme with Steganography and Authentication." In Advances in Intelligent Systems and Computing, 413–25. Singapore: Springer Singapore, 2015. http://dx.doi.org/10.1007/978-981-10-0251-9_39.

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

Eskicioglu, Ahmet M. "A Prepositioned Secret Sharing Scheme for Message Authentication in Broadcast Networks." In Communications and Multimedia Security Issues of the New Century, 363–73. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-0-387-35413-2_30.

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

Ulutas, Guzin, Mustafa Ulutas, and Vasif Nabiyev. "Improved Secret Image Sharing Method By Encoding Shared Values With Authentication Bits." In Computer and Information Sciences II, 331–35. London: Springer London, 2011. http://dx.doi.org/10.1007/978-1-4471-2155-8_42.

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

Biswas, Samarpita, Nicole Belinda Dillen, Dipak Kumar Kole, and Aruna Chakraborty. "A Time Efficient Secret Image Sharing Scheme for Group Authentication System Without Pixel Expansions." In Advances in Intelligent Systems and Computing, 55–63. New Delhi: Springer India, 2015. http://dx.doi.org/10.1007/978-81-322-2526-3_7.

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

Cheng, Xu, Fulong Chen, Dong Xie, Hui Sun, Cheng Huang, and Zhuyun Qi. "Blockchain-Based Secure Authentication Scheme for Medical Data Sharing." In Communications in Computer and Information Science, 396–411. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-15-0118-0_31.

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

Conference papers on the topic "Authentication and secret sharing"

1

Arafin, Md Tanvir, and Gang Qu. "Secret Sharing and Multi-user Authentication." In GLSVLSI '16: Great Lakes Symposium on VLSI 2016. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2902961.2903039.

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

Bannore, Aparna, Roshni Shetty, Nikita Shenai, and Vaibhavi Shetty. "User Authentication using Secret Key Sharing." In 2020 International Conference on Emerging Trends in Information Technology and Engineering (ic-ETITE). IEEE, 2020. http://dx.doi.org/10.1109/ic-etite47903.2020.308.

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

Wang, Shiuh-Jeng, I.-Shuan Lin, Ye-Lin Hsieh, and Chi-Yao Weng. "Secret Sharing Systems with Authentication-Based Steganography." In 2008 Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP). IEEE, 2008. http://dx.doi.org/10.1109/iih-msp.2008.243.

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

Naveen, Devarapalli, and K. Praveen. "PUF Authentication using Visual Secret Sharing Scheme." In 2019 5th International Conference on Advanced Computing & Communication Systems (ICACCS). IEEE, 2019. http://dx.doi.org/10.1109/icaccs.2019.8728504.

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

Li, Peng, Peijun Ma, and Xiaohong Su. "Image Secret Sharing and Hiding with Authentication." In 2010 First International Conference on Pervasive Computing, Signal Processing and Applications (PCSPA 2010). IEEE, 2010. http://dx.doi.org/10.1109/pcspa.2010.95.

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

Nozaki, Yusuke, and Masaya Yoshikawa. "Secret Sharing Schemes Based Secure Authentication for Physical Unclonable Function." In 2019 IEEE 4th International Conference on Computer and Communication Systems (ICCCS). IEEE, 2019. http://dx.doi.org/10.1109/ccoms.2019.8821698.

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

Nimmy K. "Novel multi-server authentication protocol using secret sharing." In 2016 International Conference on Data Mining and Advanced Computing (SAPIENCE). IEEE, 2016. http://dx.doi.org/10.1109/sapience.2016.7684135.

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

Narad, S. K., M. R. Sayankar, S. V. Alone, and P. S. Mahiskar. "Secret sharing scheme for group authentication — A review." In 2017 International Conference of Electronics, Communication and Aerospace Technology (ICECA). IEEE, 2017. http://dx.doi.org/10.1109/iceca.2017.8203663.

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

Gupta, Kishor Datta, Md Lutfar Rahman, Dipankar Dasgupta, and Subash Poudyal. "Shamir's Secret Sharing for Authentication without Reconstructing Password." In 2020 10th Annual Computing and Communication Workshop and Conference (CCWC). IEEE, 2020. http://dx.doi.org/10.1109/ccwc47524.2020.9031270.

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

Rajendra, A. B., and H. S. Sheshadri. "Enhanced visual secret sharing for graphical password authentication." In 2012 International Conference on Graphic and Image Processing, edited by Zeng Zhu. SPIE, 2013. http://dx.doi.org/10.1117/12.2010934.

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

Reports on the topic "Authentication and secret sharing"

1

Vixie, P., O. Gudmundsson, D. Eastlake, and B. Wellington. Secret Key Transaction Authentication for DNS (TSIG). RFC Editor, May 2000. http://dx.doi.org/10.17487/rfc2845.

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

Dupont, F., S. Morris, P. Vixie, D. Eastlake, O. Gudmundsson, and B. Wellington. Secret Key Transaction Authentication for DNS (TSIG). RFC Editor, November 2020. http://dx.doi.org/10.17487/rfc8945.

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

Wong, Theodore M., Chenxi Wang, and Jeannette M. Wing. Verifiable Secret Redistribution for Threshold Sharing Schemes. Fort Belvoir, VA: Defense Technical Information Center, October 2002. http://dx.doi.org/10.21236/ada461227.

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

Vanderveen, M., and H. Soliman. Extensible Authentication Protocol Method for Shared-secret Authentication and Key Establishment (EAP-SAKE). RFC Editor, November 2006. http://dx.doi.org/10.17487/rfc4763.

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

Kwan, S., P. Garg, J. Gilroy, L. Esibov, J. Westhead, and R. Hall. Generic Security Service Algorithm for Secret Key Transaction Authentication for DNS (GSS-TSIG). RFC Editor, October 2003. http://dx.doi.org/10.17487/rfc3645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Authentication and secret sharing' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography