Log in

Relevant bibliographies by topics / Secrecy efficiency / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Secrecy efficiency.

Dissertations / Theses on the topic 'Secrecy efficiency'

Author: Grafiati

Published: 4 June 2021

Last updated: 13 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 30 dissertations / theses for your research on the topic 'Secrecy efficiency.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Alotaibi, Nafel Nahes A. "Improving secrecy and spectral efficiency of wireless communications." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/improving-secrecy-and-spectral-efficiency-of-wireless-communications(55496177-4602-42ff-99e4-7a65d26e08f9).html.

Full text

Abstract:

The current and future demand for wireless technology is increasing rapidlyin the era of Internet-of-things, information-shower, auto-drive vehicles andthe fifth generation of mobile communications. The flourishing in wirelesstechnologies comes from their advantages such as mobility, flexibility, easy toextend, easy to install and easy to do the maintenance. However, the wirelesstechnology is suffering from many problems such as; lack of security andthe shortage of spectrum bands. The security remains a major challenge forthe wireless communications because of the broadcasting nature of wirele

APA, Harvard, Vancouver, ISO, and other styles

2

Barceló, Lladó Joan Enric. "Communications in Wireless Sensor Networks: Compression, Energy Efficiency and Secrecy." Doctoral thesis, Universitat Autònoma de Barcelona, 2012. http://hdl.handle.net/10803/97359.

Full text

Abstract:

Les xarxes de sensors sense fils (WSNs) han esdevingut un dels sistemes de comunicació amb més projecció d'aquesta dècada. Abasten una àmplia varietat d’aplicacions tals com la monitorització del medi ambient, la predicció de desastres naturals, en medicina, en transport, posicionament en interiors, i tasques militars. Els nodes que composen la xarxa, són típicament de baix cost, cosa que atorga una sèrie de limitacions en termes d’energia, velocitat de càlcul i d’ample de banda. Amb els avenços de les comunicacions sense fils i la creixent demanda de noves i més complexes aplicacions, les WSN

APA, Harvard, Vancouver, ISO, and other styles

3

Tanga, Vikas Reddy. "The Chief Security Officer Problem." Thesis, University of North Texas, 2018. https://digital.library.unt.edu/ark:/67531/metadc1404557/.

Full text

Abstract:

The Chief Security Officer Problem (CSO) consists of a CSO, a group of agents trying to communicate with the CSO and a group of eavesdroppers trying to listen to the conversations between the CSO and its agents. Through Lemmas and Theorems, several Information Theoretic questions are answered.

APA, Harvard, Vancouver, ISO, and other styles

4

Polisetti, Mounika. "Physical Layer Security With Active Jamming Using NOMA." Thesis, Blekinge Tekniska Högskola, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-21259.

Full text

Abstract:

This paper is persuaded to understand the physical layer security in wireless commu-nications utilizing NOMA (Non Orthogonal Multiple Access) concepts in the presence of an eavesdropper. Physical layer security maintains the confidentiality and secrecyof the system against eavesdroppers. We use the power domain in this paper, where NOMA allows many users to share resources side by side. Power allocation concern-ing channel condition is taken into consideration where user whose channel condition is weak is allocated with eminent power to directly decode the signal, whereas theuser with better c

APA, Harvard, Vancouver, ISO, and other styles

5

Vasudevan, Prashant Nalini. "A study of efficient secret sharing." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101590.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 49-52).<br>We show a general connection between various types of statistical zero-knowledge (SZK) proof systems and (unconditionally secure) secret sharing schemes. Viewed through the SZK lens, we obtain several new results on secret-sharing: " Characterizations: We obtain an almost-characterization of access structures for which there are secret-sharing schemes with an efficient sharing algo

APA, Harvard, Vancouver, ISO, and other styles

6

Choudary, Omar-Salim. "Efficient multivariate statistical techniques for extracting secrets from electronic devices." Thesis, University of Cambridge, 2014. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.708342.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Lüdtke, Susann [Verfasser]. "The Secret of Lobbying in China : Who Influences Building Energy Efficiency Standards? / Susann Lüdtke." Baden-Baden : Nomos Verlagsgesellschaft mbH & Co. KG, 2020. http://d-nb.info/1212393503/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Abdulla, Alan Anwer. "Exploiting similarities between secret and cover images for improved embedding efficiency and security in digital steganography." Thesis, University of Buckingham, 2015. http://bear.buckingham.ac.uk/149/.

Full text

Abstract:

The rapid advancements in digital communication technology and huge increase in computer power have generated an exponential growth in the use of the Internet for various commercial, governmental and social interactions that involve transmission of a variety of complex data and multimedia objects. Securing the content of sensitive as well as personal transactions over open networks while ensuring the privacy of information has become essential but increasingly challenging. Therefore, information and multimedia security research area attracts more and more interest, and its scope of application

APA, Harvard, Vancouver, ISO, and other styles

9

Potay, Sunny. "Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography." TopSCHOLAR®, 2012. http://digitalcommons.wku.edu/theses/1151.

Full text

Abstract:

Secret Sharing refers to a method through which a secret key K can be shared among a group of authorized participants, such that when they come together later, they can figure out the secret key K to decrypt the encrypted message. Any group which is not authorized cannot determine the secret key K. Some of the important secret schemes are Shamir Threshold Scheme, Monotone Circuit Scheme, and Brickell Vector Space Scheme. Brikell’s vector space secret sharing construction requires the existence of a function from a set of participant P in to vector space Zdp, where p is a prime number and d is

APA, Harvard, Vancouver, ISO, and other styles

10

Osorio, Carlos Ivan Henao. "Robustness against noise and efficiency of two-way quantum key distribution protocols." reponame:Repositório Institucional da UFABC, 2014.

Find full text

Abstract:

Orientador: Prof. Dr Carlos Ivan Henao Osorio<br>Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Física, 2014.<br>Neste trabalho, apresentamos novos resultados sobre segurança de protocolos de distribuição quântica de chave de duas vías (TWQKD por suas iniciáis em inglês) que utilizam estados não ortogonáis. Trabalhamos no cenário de protocolos para os quais o pós-processamento é feito com comunicação clássica de uma via e não há pre-processamento. O análise de segurança é implementado com tecnicas que permitem cubrir conjuntos de protocolos bastante amplos.

APA, Harvard, Vancouver, ISO, and other styles

11

Richter, Johannes, Elke Franz, Sabrina Engelmann, Stefan Pfennig, and Eduard A. Jorswieck. "Physical Layer Security vs. Network Layer Secrecy: Who Wins on the Untrusted Two-Way Relay Channel?" Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-145086.

Full text

Abstract:

We consider the problem of secure communications in a Gaussian two-way relay network where two nodes exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We analyze the achievable secrecy rates by applying network coding on the physical layer or the network layer and compare the results in terms of complexity, overhead, and efficiency. Further, we discuss the advantages and disadvantages of the respective approaches.

APA, Harvard, Vancouver, ISO, and other styles

12

Richter, Johannes, Elke Franz, Sabrina Engelmann, Stefan Pfennig, and Eduard A. Jorswieck. "Physical Layer Security vs. Network Layer Secrecy: Who Wins on the Untrusted Two-Way Relay Channel?" Technische Universität Dresden, 2013. https://tud.qucosa.de/id/qucosa%3A28133.

Full text

Abstract:

We consider the problem of secure communications in a Gaussian two-way relay network where two nodes exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We analyze the achievable secrecy rates by applying network coding on the physical layer or the network layer and compare the results in terms of complexity, overhead, and efficiency. Further, we discuss the advantages and disadvantages of the respective approaches.

APA, Harvard, Vancouver, ISO, and other styles

13

崇之, 清水. "Secure and efficient key generation schemes for secret key agreement based on radio propagation characteristics." Thesis, https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12424275/?lang=0, 2012. https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12424275/?lang=0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Subbiah, Arun. "Efficient Proactive Security for Sensitive Data Storage." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19719.

Full text

Abstract:

Fault tolerant and secure distributed data storage systems typically require that only up to a threshold of storage nodes can ever be compromised or fail. In proactively-secure systems, this requirement is modified to hold only in a time interval (also called epoch), resulting in increased security. An attacker or adversary could compromise distinct sets of nodes in any two time intervals. This attack model is also called the mobile adversary model. Proactively-secure systems require all nodes to "refresh" themselves periodically to a clean state to maintain the availability, integrity, and co

APA, Harvard, Vancouver, ISO, and other styles

15

Wen, Wen. "Energy Efficient Secure Key Management Schemes for WSNs and IoT." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35257.

Full text

Abstract:

Secret sharing is critical to most applications making use of security and remains one of the most challenging research areas in modern cryptography. In this thesis, we propose a novel efficient multi-secret sharing scheme based on the Chinese remainder theorem (CRT) with two verification methods, while the previous works are mostly based on the Lagrange polynomial. Key management schemes play an important role in communication security in Wireless Sensor Networks (WSNs). While the previous works mainly targeting on two different types of WSNs: distributed and hieratical, in this thesis, we

APA, Harvard, Vancouver, ISO, and other styles

16

Jorswieck, Eduard A., Anne Wolf, and Sabrina Engelmann. "Secret key generation from reciprocal spatially correlated MIMO channels." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-143998.

Full text

Abstract:

Secret key generation from reciprocal multi-antenna channels is an interesting alternative to cryptographic key management in wireless systems without infrastructure access. In this work, we study the secret key rate for the basic source model with a MIMO channel. First, we derive an expression for the secret key rate under spatial correlation modelled by the Kronecker model and with spatial precoding at both communication nodes. Next, we analyze the result for uncorrelated antennas to understand the optimal precoding for this special case, which is equal power allocation. Then, the impact of

APA, Harvard, Vancouver, ISO, and other styles

17

Ho, Zuleita K. M., Eduard A. Jorswieck, and Sabrina Engelmann. "Efficient information leakage neutralization on a relay-assisted multi-carrier interference channel." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-128447.

Full text

Abstract:

In heterogeneous dense networks where spectrum is shared, users privacy remains one of the major challenges. When the receivers are not only interested in their own signals but also in eavesdropping other users' signals, the cross talk becomes information leakage.We propose a novel and efficient secrecy rate enhancing relay strategy EFFIN for information leakage neutralization. The relay matrix is chosen such that the effective leakage channel (spectral and spatial) is zero. Thus, it ensures secrecy regardless of receive processing employed at eavesdroppers and does not rely on wiretaps codes

APA, Harvard, Vancouver, ISO, and other styles

18

Jorswieck, Eduard A., Anne Wolf, and Sabrina Engelmann. "Secret key generation from reciprocal spatially correlated MIMO channels." Technische Universität Dresden, 2013. https://tud.qucosa.de/id/qucosa%3A28101.

Full text

Abstract:

Secret key generation from reciprocal multi-antenna channels is an interesting alternative to cryptographic key management in wireless systems without infrastructure access. In this work, we study the secret key rate for the basic source model with a MIMO channel. First, we derive an expression for the secret key rate under spatial correlation modelled by the Kronecker model and with spatial precoding at both communication nodes. Next, we analyze the result for uncorrelated antennas to understand the optimal precoding for this special case, which is equal power allocation. Then, the impact of

APA, Harvard, Vancouver, ISO, and other styles

19

Ho, Zuleita, Eduard Jorswieck, and Sabrina Engelmann. "Information Leakage Neutralization for the Multi-Antenna Non-Regenerative Relay-Assisted Multi-Carrier Interference Channel." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-121245.

Full text

Abstract:

In heterogeneous dense networks where spectrum is shared, users' privacy remains one of the major challenges. On a multi-antenna relay-assisted multi-carrier interference channel, each user shares the spectral and spatial resources with all other users. When the receivers are not only interested in their own signals but also in eavesdropping other users' signals, the cross talk on the spectral and spatial channels becomes information leakage. In this paper, we propose a novel secrecy rate enhancing relay strategy that utilizes both spectral and spatial resources, termed as information leakage

APA, Harvard, Vancouver, ISO, and other styles

20

Aditya, Riza. "Secure Electronic Voting with Flexible Ballot Structure." Queensland University of Technology, 2005. http://eprints.qut.edu.au/16156/.

Full text

Abstract:

Voting is a fundamental decision making instrument in any consensus-based society. It is employed in various applications from student body elections, reality television shows, shareholder meetings, to national elections. With the motivation of better eciency, scalability, speed, and lower cost, voting is currently shifting from paper-based to the use of electronic medium. This is while aiming to achieve better security, such that voting result reflects true opinions of the voters. Our research focuses on the study of cryptographic voting protocols accommodating a flexible ballot structu

APA, Harvard, Vancouver, ISO, and other styles

21

Megahed, Mohamed Helmy Mostafa. "SurvSec Security Architecture for Reliable Surveillance WSN Recovery from Base Station Failure." Thèse, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31154.

Full text

Abstract:

Surveillance wireless sensor networks (WSNs) are highly vulnerable to the failure of the base station (BS) because attackers can easily render the network useless for relatively long periods of time by only destroying the BS. The time and effort needed to destroy the BS is much less than that needed to destroy the numerous sensing nodes. Previous works have tackled BS failure by deploying a mobile BS or by using multiple BSs, which requires extra cost. Moreover, despite using the best electronic countermeasures, intrusion tolerance systems and anti-traffic analysis strategies to protect the BS

APA, Harvard, Vancouver, ISO, and other styles

22

Hsu, Hsing, and 許行. "Efficient Secure Electronic Mail Protocols with Forward Secrecy." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/4w482y.

Full text

Abstract:

碩士<br>國立中山大學<br>資訊工程學系研究所<br>95<br>In 1976, Diffie and Hellman proposed the concept of public key cryptosystem (PKC). The application and research of public key cryptography are arisen in the modern cryptography. In 2005, Sun, Hsieh, and Hwang (S.H.H.) proposed an electronic mail protocol based on classic public key cryptography. The technique of the Certificate of Encrypted Message Being a Signature (CEMBS) that Bao proposed in 1998 is applied on session key sharing of their e-mail system. In the same year, Dent pointed out that the first one of S.H.H.’s e-mail protocols cannot suffice th

APA, Harvard, Vancouver, ISO, and other styles

23

Lee, Chen-Kuei, and 李振魁. "Round-Efficient Conference Key Agreement Protocols with Forward Secrecy." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/06799614143224174850.

Full text

Abstract:

碩士<br>國立交通大學<br>資訊科學系所<br>92<br>A conference key agreement protocol allows a group of participants to establish a common secret key distributively, such that all their communications afterward are encrypted by the key. By this way, the participants can communicate securely over an open network. We propose two provably forward secure conference key agreement protocols under the broadcast channel model. Also, we prove its security under the Bellare-Rogaway model. The adversary that attacks our protocols can be either passive or active. A passive adversary tries to learn the conference key by li

APA, Harvard, Vancouver, ISO, and other styles

24

Fang, Jiun-Min, and 方竣民. "An Efficient Multi-group Secret Handshake Protocol." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/20356018698140179580.

Full text

Abstract:

碩士<br>國立中興大學<br>資訊科學與工程學系<br>102<br>The first secret handshake protocol was proposed by D. Balfanz et al. in 2003. A secret handshake scheme provides not only mutual authentication for two valid members without revealing their affiliations. Malicious adversaries cannot learn any sensitive information from a secret handshake session. This thesis proposes a new multi-group secret handshake scheme where members can be affiliated to many groups in the same time. If two members belong to one or more groups, we can verify this fact quickly. Moreover, we also discuss the security properties and its e

APA, Harvard, Vancouver, ISO, and other styles

25

Liu, An-Ting, and 劉安庭. "Efficient Conference Key Protocol Based on Secret Sharing." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/68g439.

Full text

Abstract:

碩士<br>國立臺中科技大學<br>資訊工程系碩士班<br>104<br>The rapid growth of technological advances has allowed all conferees to hold a mobile conference via wireless communications. A common one-time session key is required for sharing among group members in secure communication. Based on secret sharing, this article proposes a secure authenticated group key transfer protocol. The proposed method could provide information-theoretically secure. Without any interactive protocol among participants are required to construct the common key. It could save on communication overhead. Moreover, the proposed method needs

APA, Harvard, Vancouver, ISO, and other styles

26

Chao, Cheng-Tsung, and 趙承宗. "Efficient Cheater Identification in Sequential Secret Sharing Schemes." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/48323577780858317542.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電機工程學系研究所<br>86<br>A secret sharing scheme is a method of hiding a secret by a dealeramong sev eral shadows such that some participants can reconstruct thesecret. In this th esis we propose two efficient secret sharing schemesthat can identify cheaters faster than the previous works. Our schemesare based on the sequential model and greatly reduce the amount of data kept by the participants. In our schemes , the dealer only has to send O(n) data instead of O((n^2)m) for the previous work i

APA, Harvard, Vancouver, ISO, and other styles

27

Lee, Wei, and 李威. "Efficient Secret Sharing with Access Structures in a Hierarchy." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/66864684608805400310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Chung, I.-Chia, and 鍾一嘉. "An Efficient Fault-tolerant Cloud Storage Scheme Based on Secret Sharing." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/a5r7ze.

Full text

Abstract:

碩士<br>國立中山大學<br>資訊工程學系研究所<br>105<br>An efficient and fault-tolerant cloud storage scheme for file owners is presented in this paper. A large file is first divided into secrets, and each secret is then divided into shares by using a (k, l, L, n)-threshold secret sharing scheme. These shares are finally uploaded into n-l cloud storage servers. To retrieve the file, any k shares of each secret are first retrieved from some of the servers. The value of each secret can then be computed from these k shares, and the original files can then be assembled from these secrets. The scheme achieves the foll

APA, Harvard, Vancouver, ISO, and other styles

29

Huang, Ta-ming, and 黃大明. "A New Efficient RFID Mutual Authentication Scheme based on Synchronized Secret Information." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/ss69k3.

Full text

Abstract:

碩士<br>南華大學<br>資訊管理學研究所<br>95<br>In 2006, Sangshin Lee et.al, proposed a RFID Mutual Authentication Scheme based on Synchronized Secret Information [14]. They claim their protocol can not only protect user privacy utilizing Hash function and synchronized secret information published schemes, but also can resist against RFID tag cloning. But, in their scheme the back-end　database must use the brute force computation to search for the confirmation to be unmistakable. For this reason, the back-end database is not efficient, especially when massive data needed to be confirmed [14][15]. Therefore, w

APA, Harvard, Vancouver, ISO, and other styles

30

Chen, Kuan-Hung, and 陳冠宏. "Efficient Multiparty Quantum Key Agreement based on Quantum Secret Direct Communication with GHZ States." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/19679952056662688721.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>103<br>Quantum Key Agreement (QKA) signifies that two or more participants together generate a key and QKA has to satisfy the following conditions: (1) Every participant can change the key and the key is not decided by any participant individually. (2) Only participants can know the key; nonparticipants cannot get the key through illegal means. Because of the conditions of participating together, it makes transport inefficient in the current mainstream protocols. They use unicast to exchange messages one by one, so it will considerably limit transmission efficiency

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!