Relevant bibliographies by topics / Message authentication code (MAC)

Contents

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

Academic literature on the topic 'Message authentication code (MAC)'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 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 'Message authentication code (MAC).'

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 "Message authentication code (MAC)"

1

Michail, H. E., G. Selimis, M. Galanis, D. Schinianakis, and C. E. Goutis. "Novel Hardware Implementation of the Cipher Message Authentication Code." Journal of Computer Systems, Networks, and Communications 2008 (2008): 1–6. http://dx.doi.org/10.1155/2008/923079.

Full text
Abstract:
A new algorithm for producing message authenticating codes (MACs) was recently proposed by NIST. The MAC protects both a message's integrity—by ensuring that a different MAC will be produced if the message has changed—as well as its authenticity because only someone who knows the secret key could have generated a valid MAC. The proposed security scheme incorporates an FIPS approved and secure block cipher algorithm and was standardized by NIST in May, 2005. In this paper is presented the first efficient hardware implementation of the CMAC standard.
APA, Harvard, Vancouver, ISO, and other styles
2

Mousavi, Seyyed Mehdi, and Dr Mohammad Hossein Shakour. "Increasing Cryptographic Security Using Message Authentication Code (MAC)." International Journal of Engineering and Technology 11, no. 4 (August 31, 2019): 912–17. http://dx.doi.org/10.21817/ijet/2019/v11i4/191104073.

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

Echandouri, Bouchra, Fouzia Omary, Fatima Ezzahra Ziani, and Anas Sadak. "SEC-CMAC A New Message Authentication Code Based on the Symmetrical Evolutionist Ciphering Algorithm." International Journal of Information Security and Privacy 12, no. 3 (July 2018): 16–26. http://dx.doi.org/10.4018/ijisp.2018070102.

Full text
Abstract:
This article describes how the simplicity of data transmission made eavesdropping by malicious people easier. This became one the flaws of computer security that needs to be handled. In order to establish a secure data communication, many data security techniques were developed to ensure privacy, integrity and authenticity. One of the techniques developed was to fulfill authentication with a message authentication code (MAC) that was defined by the National Institute of Standards and Technology. It is still a powerful data integrity and authentication tool that provides better protection than error detection codes or checksums. In this article, the authors propose a new cipher-based message authentication code (CMAC) algorithm. Their proposed algorithm, termed SEC-CMAC, is based on a previously developed symmetric evolutionist ciphering algorithm named symmetrical evolutionist ciphering (SEC). Compared to the well-known previously developed MAC, their suggested algorithm proved to be robust and fulfill some security requirement by resisting an exhaustive key search and mac forgery attacks.
APA, Harvard, Vancouver, ISO, and other styles
4

Ichwan, M., Milda Gustian, and Novan Rizky Nurjaman. "Implementasi Keyed-Hash Message Authentatication Code Pada Sistem Keamanan Rumah." MIND Journal 1, no. 1 (May 12, 2018): 9. http://dx.doi.org/10.26760/mindjournal.v1i1.9.

Full text
Abstract:
Keyed-Hash Message Authentication Code (HMAC) adalah algoritma untuk menghitung nilai MAC (Message Authentication Code) yang menggunakan Fungsi Hash dikombinasikan dengan sebuah kunci rahasia, Fungsi Hash yang digunakan dalam penelitian ini adalah Secure Ha sh Algorithm 256 (SHA256). Nilai MAC digunakan sebagai otentikasi untuk menjamin integritas data dan keaslian pesan. Algoritma ini di implementasikan pada sistem keamanan rumah, dimana pertukaran pesan antara user dan sistem keamanan di otentikasi dengan menggunakan HMAC. Keamanan algoritma HMAC ini dibuktikan dengan hasil pengujian Avalanche effect yang mencapai 87.5% pada fungsi Hash yang digunakan ,dan dibutuhkan waktu sampai 84 tahun untuk serangan Brute force berhasil pada kunci dengan panjang 8 karakter. Kata kunci: keyed-Hash Message Authentication Code, Hash function, Avalanche effect, Brute force attack
APA, Harvard, Vancouver, ISO, and other styles
5

Abdulla, Abdulla, and Yaseen Ismaeel. "Applying Message Authentication Code (MAC) in text chatting system." TANMIYAT AL-RAFIDAIN 30, no. 92 (December 1, 2008): 9–18. http://dx.doi.org/10.33899/tanra.2008.161723.

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

Noh, Jaewon, Sangil Jeon, and Sunghyun Cho. "Distributed Blockchain-Based Message Authentication Scheme for Connected Vehicles." Electronics 9, no. 1 (January 1, 2020): 74. http://dx.doi.org/10.3390/electronics9010074.

Full text
Abstract:
Vehicular ad-hoc networks (VANETs) have several security issues such as privacy preservation, secure authentication, and system reliability. In the VANET, a vehicle communicates with other vehicles or infrastructures using broadcasting messages. These messages contain not only normal traffic information, but also identification information of sender. In general, the identification information remains encrypted to ensure privacy. However, the conventional centralized system can decrypt the identification information using private information of the sender vehicle. As a result, the central server can often be targeted by adversaries. We propose a message authentication scheme for anonymity and decentralization of information using blockchain technology. Here, we introduce public-private key and message authentication code (MAC) for secure authentication. In this paper, we adopt consensus algorithms for composing blockchain system such as the proof of work (PoW) and Practical Byzantine Fault Tolerance (PBFT) into the proposed authentication process. Finally, we demonstrate that the proposed method is secure from the attacks which include impersonation from internal attacker as well as typical attacks.
APA, Harvard, Vancouver, ISO, and other styles
7

Hussain, S. M. Suhail, Shaik Mullapathi Farooq, and Taha Selim Ustun. "Analysis and Implementation of Message Authentication Code (MAC) Algorithms for GOOSE Message Security." IEEE Access 7 (2019): 80980–84. http://dx.doi.org/10.1109/access.2019.2923728.

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

Zivic, Natasa. "Principles of Soft Verification." International Journal of Distributed Systems and Technologies 4, no. 1 (January 2013): 1–15. http://dx.doi.org/10.4018/jdst.2013010101.

Full text
Abstract:
This paper considers messages protected with the Message Authentication Code (MAC) for the sake of authenticity. The standard forward error correcting channel code is assumed, which reduces the error rate, but no repeat mechanism exists to correct the remaining errors. The uncorrected errors cause the rejection of messages with a wrong MAC, as a successful MAC verification (“hard” verification) demands errorless message and errorless MAC. This paper introduces the extension of “hard” verification of MACs, whose result is “true” or “false”, to “soft” verification, that outputs additionally a trust level as verification result. This allows the acceptance of corrected messages and their MACs, even if a few bits of the MAC are different from the expected value. The costs are a loss of trust, as trust is defined for the successful standard or “hard” verification, i.e. for errorless message and its MAC. Therefore “Trust Output” is accompanied with the output of the verification process. A definition of “Trust Level” will be given, together with an algorithm of “soft” verification, which provides such Trust Output. This algorithm is based on a Soft Output channel decoder, which provides a reliability value for each bit, which is used as soft input for the proposed algorithm, “Soft Input Trust Output”. Simulation results show an essential improvement of the acceptance rate of MACs - at the cost of a reduced trust level. The reduction can be calculated and the maximum permitted reduction of the trust level can be preset.
APA, Harvard, Vancouver, ISO, and other styles
9

Muraharirao, Siva Charan, and Manik Lal Das. "Digital Image Protection using Keyed Hash Function." International Journal of Computer Vision and Image Processing 2, no. 2 (April 2012): 36–47. http://dx.doi.org/10.4018/ijcvip.2012040103.

Full text
Abstract:
Digital image authentication is an essential attribute for protecting digital image from piracy and copyright violator. Anti-piracy, digital watermarking, and ownership verification are some mechanisms evolving over the years for achieving digital image authentication. Cryptographic primitives, such as hash function, digital signature, and message authentication codes are being used in several applications including digital image authentication. Use of Least Significant Bit (LSB) is one of the classical approaches for digital image authentication. Although LSB approach is efficient, it does not provide adequate security services. On the other hand, digital signature-based image authentication provides better security, but with added computational cost in comparison with LSB approach. Furthermore, digital signature-based authentication approach requires managing public key infrastructure. Considering security weakness of LSB-based approach and cost overhead of public key based approach, the authors present a digital image authentication scheme using LSB and message authentication codes (MAC). The MAC-based approach for authenticating digital image is secure and efficient approach without public key management overhead. The authors also provide experimental results of the proposed scheme using MATLAB. The experimental results show that the proposed scheme is efficient and secure in comparisons with other schemes.
APA, Harvard, Vancouver, ISO, and other styles
10

Jabiullah, Md Ismail, AA Md Monzur Ul Akhir, and Muhammed Rasheduzzaman. "A Double-Key Based Encryption-Decryption Process for Stronger Secured Message Transactions." GUB Journal of Science and Engineering 6, no. 1 (October 13, 2020): 75–80. http://dx.doi.org/10.3329/gubjse.v6i1.52053.

Full text
Abstract:
A double-key based stronger secured electronic message transaction system has been designed and developed using Python programming language by performing encryption-decryption process. To do this, simple cryptographic encryption and decryption techniques are used with two keys avoiding vulnerabilities of a single key. First, the intended message is encrypted with the private key of sender (PRa) and the output is again encrypted with a shared secret key (K1) that generates ciphertext. The output ciphertext is again encrypted with another shared secret key (K2) that generates a code that serves as Message Authentication Code (MAC), which is concatenated with the ciphertext. And again encrypted them with shared secret key K1 that produced final ciphertext which is to be send to the intending recipient. The shared secret keys K1 and K2 are getting from the key distribution center (KDC). In the receiving end, receiver first decrypts the received information with the shared secret key K1 that gives the ciphertext and MAC of the ciphertext, and then decrypts only the MAC to generate a new ciphertext′and compare the new ciphertext′ with the received ciphertext that ensures the ciphertext authentication as well as message authentication; if ciphertexts are found same, then the ciphertext is decrypted with shared secret key K2 and again is decrypted with the sender’s public key (PUa) and retrieve the message; otherwise discarded. This proposed system ensures the stronger authenticated message transactions among the communicants. Finally, a comparative study with the existing systems has also been performed and measured stronger security. This technique can be applied for any secured electronic information transfer system with stronger security services. GUB JOURNAL OF SCIENCE AND ENGINEERING, Vol 6(1), Dec 2019 P 75-80
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Message authentication code (MAC)"

1

Huang, An-Lun. "Security primitives for ultra-low power sensor nodes in wireless sensor networks." Diss., University of Pretoria, 2007. http://hdl.handle.net/2263/24343.

Full text
Abstract:
The concept of wireless sensor network (WSN) is where tiny devices (sensor nodes), positioned fairly close to each other, are used for sensing and gathering data from its environment and exchange information through wireless connections between these nodes (e.g. sensor nodes distributed through out a bridge for monitoring the mechanical stress level of the bridge continuously). In order to easily deploy a relatively large quantity of sensor nodes, the sensor nodes are typically designed for low price and small size, thereby causing them to have very limited resources available (e.g. energy, processing power). Over the years, different security (cryptographic) primitives have been proposed and refined aiming at utilizing modern processor’s power e.g. 32-bit or 64-bit operation, architecture such as MMX (Multi Media Extension) and etc. In other words, security primitives have targeted at high-end systems (e.g. desktop or server) in software implementations. Some hardware-oriented security primitives have also been proposed. However, most of them have been designed aiming only at large message and high speed hashing, with no power consumption or other resources (such as memory space) taken into considerations. As a result, security mechanisms for ultra-low power (<500µW) devices such as the wireless sensor nodes must be carefully selected or designed with their limited resources in mind. The objective of this project is to provide implementations of security primitives (i.e. encryption and authentication) suitable to the WSN environment, where resources are extremely limited. The goal of the project is to provide an efficient building block on which the design of WSN secure routing protocols can be based on, so it can relieve the protocol designers from having to design everything from scratch. This project has provided three main contributions to the WSN field.  Provides analysis of different tradeoffs between cryptographic security strength and performances, which then provide security primitives suitable for the needs in a WSN environment. Security primitives form the link layer security and act as building blocks for higher layer protocols i.e. secure routing protocol.  Implements and optimizes several security primitives in a low-power microcontroller (TI MSP430F1232) with very limited resources (256 bytes RAM, 8KB flash program memory). The different security primitives are compared according to the number of CPU cycles required per byte processed, specific architectures required (e.g. multiplier, large bit shift) and resources (RAM, ROM/flash) required. These comparisons assist in the evaluation of its corresponding energy consumption, and thus the applicability to wireless sensor nodes.  Apart from investigating security primitives, research on various security protocols designed for WSN have also been conducted in order to optimize the security primitives for the security protocols design trend. Further, a new link layer security protocol using optimized security primitives is also proposed. This new protocol shows an improvement over the existing link layer security protocols. Security primitives with confidentiality and authenticity functions are implemented in the TinyMote sensor nodes from the Technical University of Vienna in a wireless sensor network. This is to demonstrate the practicality of the designs of this thesis in a real-world WSN environment. This research has achieved ultra-low power security primitives in wireless sensor network with average power consumption less than 3.5 µW (at 2 second packet transmission interval) and 700 nW (at 5 second packet transmission interval). The proposed link layer security protocol has also shown improvements over existing protocols in both security and power consumption.
Dissertation (MEng (Computer Engineering))--University of Pretoria, 2008.
Electrical, Electronic and Computer Engineering
unrestricted
APA, Harvard, Vancouver, ISO, and other styles
2

NEIMAN, ADAM M. "HASH STAMP MARKING SCHEME FOR PACKET TRACEBACK." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1130852252.

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

Tomaz, Antonio Emerson Barros. "Resgate de autoria em esquemas de assinatura em anel." reponame:Repositório Institucional da UFC, 2014. http://www.repositorio.ufc.br/handle/riufc/10842.

Full text
Abstract:
TOMAZ. A. E. B. Resgate de autoria em esquemas de assinatura em anel. 2014. 67 f. Dissertação (Mestrado em Engenharia de Teleinformática) - Centro de Tecnologia, Universidade Federal do Ceará, Fortaleza, 2014.
Submitted by Marlene Sousa (mmarlene@ufc.br) on 2015-02-27T18:29:04Z No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)
Approved for entry into archive by Marlene Sousa(mmarlene@ufc.br) on 2015-03-04T16:09:55Z (GMT) No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5)
Made available in DSpace on 2015-03-04T16:09:55Z (GMT). No. of bitstreams: 1 2014_dis_aebtomaz.pdf: 1072067 bytes, checksum: 405260d86425363feaec1802b2775de1 (MD5) Previous issue date: 2014-05-23
The proposal presented in this thesis represents an expansion of the original concept of ring signature. A ring signature scheme allows a member of a group to publish a message anonymously, so that each member of the group can be considered the author of the message. The main idea of a ring signature is to guarantee the anonymity of the subscriber also ensure the authenticity of information, showing that the message came from one of the members of that group. This thesis presents a signature scheme based on (RIVEST et al., 2001), where the subscriber can later revoke anonymity presenting secret values that prove that he would only be able to generate such a signature. This property will be referred to here as rescue of authorship. The main difference to the proposal of Rivest et al. (2001) is presented before we even begin signature generation. The values used as input to the trapdoor function are message authentication codes - MACs generated by the HMAC algorithm, an algorithm for message authentication based on hash function collision resistant. This simple modification will allow, in the future, the subscriber to reveal itself as the true author of the message by showing the secret values to generate those MACs.
A proposta apresentada nesta dissertação representa uma expansão do conceito original de assinatura em anel. Um esquema de assinatura em anel permite que um membro de um grupo divulgue uma mensagem anonimamente, de tal forma que cada um dos membros do grupo seja considerado o possível autor da mensagem. A ideia principal de uma assinatura em anel é garantir o anonimato do assinante e ainda garantir a autenticidade da informação, mostrando que a mensagem partiu de um dos membros do referido grupo. Esta dissertação apresenta um esquema de assinatura em anel baseado no esquema de Rivest et al. (2001), em que o assinante pode, mais tarde, revogar seu anonimato apresentando valores secretos que provam que somente ele seria capaz de gerar tal assinatura. Esta propriedade será chamada aqui de resgate de autoria. A principal diferença em relação ao trabalho de Rivest et al. (2001) é apresentada antes mesmo de começar a geração da assinatura. Os valores utilizados como entrada para a função trapdoor serão códigos de autenticação de mensagem - MACs gerados pelo algoritmo HMAC, um algoritmo de autenticação de mensagem baseado em função hash resistente à colisão. Essa modificação simples permitirá que, no futuro, o assinante revele-se como o verdadeiro autor da mensagem apresentando os valores secretos que geraram os MACs.
APA, Harvard, Vancouver, ISO, and other styles
4

Wainewright, Evelyn. "Efficient Simulation for Quantum Message Authentication." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35213.

Full text
Abstract:
A mix of physics, mathematics, and computer science, the study of quantum information seeks to understand and utilize the information that can be held in the state of a quantum system. Quantum cryptography is then the study of various cryptographic protocols on the information in a quantum system. One of the goals we may have is to verify the integrity of quantum data, a process called quantum message authentication. In this thesis, we consider two quantum message authentication schemes, the Clifford code and the trap code. While both of these codes have been previously proven secure, they have not been proven secure in the simulator model, with an efficient simulation. We offer a new class of simulator that is efficient, so long as the adversary is efficient, and show that both of these codes can be proven secure using the efficient simulator. The efficiency of the simulator is typically a crucial requirement for a composable notion of security. The main results of this thesis have been accepted to appear in the Proceedings of the 9th International Conference on Information Theoretic Security (ICITS 2016).
APA, Harvard, Vancouver, ISO, and other styles
5

Junior, Marcos Antonio Simplício. "Algoritmos de autenticação de mensagens para redes de sensores." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-11082010-114456/.

Full text
Abstract:
Prover segurança às informações trafegadas nos mais diversos tipos de redes é algo essencial. Entretanto, redes altamente dependentes de dispositivos com recursos limitados (como sensores, tokens e smart cards) apresentam um desafio importante: a reduzida disponibilidade de memória e energia destes dispositivos, bem como sua baixa capacidade de processamento, dificultam a utilização de diversos algoritmos criptográficos considerados seguros atualmente. Este é o caso não apenas de cifras simétricas, que proveem confidencialidade aos dados, mas também de MACs (Message Authentication Code, ou Código de Autenticação de Mensagem), que garantem sua integridade e autenticidade. De fato, algumas propostas recentes de cifras de bloco dedicadas a plataformas limitadas (e.g., o Curupira-2) proveem segurança e desempenho em um nível mais adequado a este tipo de cenário do que soluções tradicionais. Seguindo uma linha semelhante, o presente trabalho concentra-se no projeto e análise MACs leves e seguros voltados a cenários com recursos limitados, com foco especial em redes de sensores sem fio (RSSF). Marvin é o nome do algoritmo de MAC proposto neste trabalho. Marvin adota a estrutura Alred, que reutiliza porções de código de uma cifra de bloco subjacente e, assim, introduz um reduzido impacto em termos de ocupação de memória. Este algoritmo apresenta uma estrutura bastante flexível e é altamente paralelizável, permitindo diversas otimizações em função dos recursos disponíveis na plataforma alvo. Como vantagem adicional, Marvin pode ser usado tanto em cenários que necessitam apenas da autenticação de mensagens quanto em esquemas de AEAD (Authenticated- Encryption with Associated Data, ou Encriptação Autenticada com Dados Associados), que aliam encriptação e autenticação. O esquema de AEAD proposto neste trabalho, denominado LetterSoup, explora as características da estrutura do Mar vin e adota uma cifra de bloco operando no modo LFSRC (Linear Feedback Shift Register Counter, ou Contador-Registrador de Deslocamento Linear com Retroalimentação). Além da especificação de ambos os algoritmos, este documento apresenta uma análise detalhada da segurança e desempenho dos mesmos em alguns cenários representativos.
Security is an important concern in any modern network. However, networks that are highly dependent on constrained devices (such as sensors, tokens and smart cards) impose a difficult challenge: their reduced availability of memory, processing power and (specially) energy hinders the deployment of many modern cryptographic algorithms known to be secure. This inconvenience affects not only the deployment of symmetric ciphers, which provide data confidentiality, but also Message Authentication Codes (MACs), used to attest the messages integrity and authenticity. Due to the existence of dedicated block ciphers whose performance and security are adequate for use in resource-constrained scenarios (e.g., the Curupira-2), the focus of this document is on the design and analysis of message authentication algorithms. Our goal is to develop a secure and lightweight solution for deployment on resource constrained scenarios, with especial focus on Wireless Sensor Networks (WSNs). Marvin is the name of the MAC algorithm proposed in this document. Marvin adopts the Alred structure, allowing it to reuse parts of an underlying block cipher machinery; as a result, Marvins implementation builds on the ciphers efficiency and introduces little impact in terms of memory occupation. Moreover, this algorithm presents a flexible and highly parallelizable structure, allowing many implementation optimizations depending on the resources available on the target platform. Marvin can be used not only as an authentication-only function, but also in an Authenticated- Encryption with Associated Data (AEAD) scheme, combining authentication and encryption. In this document, we define a new AEAD proposal called LetterSoup, which is based on the LFSRC (Linear Feedback Shift Register Counter) mode of operation and builds on Marvin. Together with the specification of both algorithms, we provide a detailed security analysis and evaluate their performance in some representative scenarios.
APA, Harvard, Vancouver, ISO, and other styles
6

Oliveira, Bruno Trevizan de. "Arquitetura de segurança fim-a-fim para redes de sensores sem fio." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-21062013-120411/.

Full text
Abstract:
Diversas aplicações de redes de sensores sem fio necessitam de serviços de segurança, como confidencialidade, integridade e autenticação de origem de dados. Contudo, dadas as limitações de processamento, memória e suprimento de energia dos dispositivos, os mecanismos de segurança tradicionais podem causar efeitos indesejáveis na rede, como atraso na comunicação e aumento no consumo de energia, impondo obstáculos para seu uso na tecnologia em questão. Muitas propostas de esquemas de segurança baseados em criptografia simétrica projetados especificamente para redes de sensores sem fio são encontradas na literatura. Contudo, essas soluções são focadas na segurança salto-a-salto. Tal abordagem é adequada para garantir a segurança dos enlaces deste tipo de rede, mas não garante a segurança na comunicação fim-a-fim. Neste trabalho são apresentados cenários e desafios de implementação de segurança neste tipo de rede, e a concepção, o projeto e a implementação de uma arquitetura de segurança para redes de sensores sem fio, que tem como objetivos: prover segurança na comunicação fim-a-fim; permitir a interoperabilidade entre diferentes sistemas; e possibilitar uma maior flexibilidade em relação à utilização de chaves criptográficas em diferentes cenários e topologias. Adicionalmente, a solução proposta suporta ativação e desativação de seus serviços em tempo de execução. O projeto da referida arquitetura, atuante na camada de aplicação da pilha de protocolos de rede, foi construído com base na análise das características de arquiteturas encontradas na literatura, bem como de estratégias adotadas por estas. Para a construção da implementação foram selecionados mecanismos e algoritmos criptográficos a partir da avaliação de desempenho que considerou assimétricas de uso de memória, tempo de execução e consumo de energia. Como resultados são apresentados a especificação da arquitetura, a avaliação qualitativa da mesma e a avaliação de desempenho da implementação desenvolvida como prova de conceito. Além disso, é apresentada uma análise do impacto de diferentes topologias e características de disposição na tarefa de distribuição de chaves criptográficas em redes de sensores sem fio.
Many wireless sensor networks applications need security services, such as confidentiality, data integrity and data source authentication. On the other hand, because of device limitations, security mechanisms may affect the network energy consumption and communication delay, which impose a great challenge for practical implementation of security mechanisms in such scenario. Many solutions based on symmetric cryptography were proposed for the specific challenges of wireless sensor networks. Nevertheless, they are focused on hop-by-hop security. Such approach is suited to provide link-layer security, but it cannot guarantee end-to-end security. This work presents scenarios and challenges to implement security in wireless sensor networks, and the conception, design and implementation of a security architecture, which aims to provide: security in end-to-end communication; interoperability between different systems, and enable greater flexibility in cryptographic keys distribution in different scenarios and topologies. Additionally, the proposed solution supports on-the-y adjustment of its security services. The architecture design, which targets the application layer of the network protocol stack, was based on the main properties of the architectures found in literature as well as adopted strategies. For the implementation, mechanisms and cryptographic algorithms were selected through the performance evaluation that considers memory usage, execution time and power consumption as metrics. The results were the architecture specification and its qualitative analysis, and the performance evaluation of the implementation developed as proof of concept. Furthermore, we present an analysis of topology and deployment impact on key distribution task.
APA, Harvard, Vancouver, ISO, and other styles
7

Lee, Ming-hua, and 李明樺. "Construct Message Authentication Code with." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/43242182443745386123.

Full text
Abstract:
碩士
國立交通大學
資訊工程系
89
In this thesis, we suggest a new method to construct Message Authentication Code with SHA-1 and AES(Rijndael), with key of 128, 192, 256 bits. In the process of MAC construction, we add a random number to prevent the problem of leaking the intermediate hash value. The security of the whole scheme is based on the block cipher, AES. That is even if the adopted hash function is not collision free or one-way, the scheme is still secure. This method provides an efficient software implementation to process long messages and has clear security properties.
APA, Harvard, Vancouver, ISO, and other styles
8

Lo, Yung-Lin, and 羅永霖. "Image Hiding with Message Authentication Code." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/99800662485507952037.

Full text
Abstract:
碩士
逢甲大學
資訊工程所
92
Steganographic methods hide the critical information in cover carriers so that it cannot be seen while it is transmitted on public communication channels. To strength the security, the secret information is recommended to encrypt before the embedding process. However, there has been growing interest in techniques that avoid encryption, because encryption software is quite slow, and encryption hardware costs are not negligible. Besides, encryption algorithms may be cover by patents, and subject to some countries export control. Thus, the major goal of this paper is to propose a novel steganographic method based on message authentication code instead to keep off these problems arisen from the encryption schemes.
APA, Harvard, Vancouver, ISO, and other styles
9

Liang, Yin-Zhen, and 梁尹蓁. "Hardware Design of Constructing Message Authentication Code." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/97211273500370404576.

Full text
Abstract:
碩士
立德管理學院
應用資訊研究所
91
We construct a Message Authentication Code (MAC), which combines Rijndael’s Advanced Encryption Standard (AES) 128-bit and Secure Hash Algorithm (SHA-1) and implement it on the Altera Field Programmable Gate Array (FPGA) chip. The AES algorithm uses the math of finite-field. We have a set of math module including multiplication and inverse operations, which can reduce the complexity of AES module. Implementation of our architecture need 17153 logic cell elements on a FPGA chip and achieves 12.4 MHz in frequency. Moreover, our proposed design does not need memory bits.
APA, Harvard, Vancouver, ISO, and other styles
10

Carvalho, Nuno Tiago Ferreira de. "A practical validation of Homomorphic Message Authentication schemes." Master's thesis, 2014. http://hdl.handle.net/1822/37266.

Full text
Abstract:
Dissertação de mestrado em Engenharia Informática
Currently, cloud computing is very appealing because it allows the user to outsource his data so it can later be accessed from multiple devices. The user can also delegate to the cloud computing service provider some, possibly complex, operations on the outsourced data. Since this service provider may not always be trusted, it is necessary to not only preserve the privacy but also to enforce the authenticity of the outsourced data. Lately, a lot of work was put on solving the first problem, specially after the introduction of the first Fully Homomorphic Encryption scheme. In this work we will focus on the latter, namely on the use of Homomorphic Message Authentication primitives. We will evaluate the current available solutions, their functionality and their security. Finally, we will provide an implementation of one of these schemes in order to verify if they are indeed practical.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Message authentication code (MAC)"

1

Technology), Information Technology Laboratory (National Institute of Standards and. The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

Information Technology Laboratory (National Institute of Standards and Technology). The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

Information Technology Laboratory (National Institute of Standards and Technology). The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

Information Technology Laboratory (National Institute of Standards and Technology). The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

Information Technology Laboratory (National Institute of Standards and Technology). The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

Information Technology Laboratory (National Institute of Standards and Technology). The keyed-hash message authentication code (HMAC). Gaithersburg, MD: U.S. Dept. of Commerce, Technology Administration, National Institute of Standards and Technology, Information Technology Laboratory, 2002.

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

E, Smid Miles, Institute for Computer Sciences and Technology. Security Technology Group., and United States. National Bureau of Standards., eds. Message authentication code (MAC) validation system: Requirements and procedures. Gaithersburg, MD: The Bureau, 1988.

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

Martin, Keith M. Data Integrity. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0006.

Full text
Abstract:
This chapter discusses cryptographic mechanisms for providing data integrity. We begin by identifying different levels of data integrity that can be provided. We then look in detail at hash functions, explaining the different security properties that they have, as well as presenting several different applications of a hash function. We then look at hash function design and illustrate this by discussing the hash function SHA-3. Next, we discuss message authentication codes (MACs), presenting a basic model and discussing basic properties. We compare two different MAC constructions, CBC-MAC and HMAC. Finally, we consider different ways of using MACs together with encryption. We focus on authenticated encryption modes, and illustrate these by describing Galois Counter mode.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Message authentication code (MAC)"

1

Pelzl, Jan, and Christof Paar. "Message Authentication Codes (MACs)." In Kryptografie verständlich, 363–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49297-0_12.

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

Paar, Christof, and Jan Pelzl. "Message Authentication Codes (MACs)." In Understanding Cryptography, 319–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-04101-3_12.

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

Weik, Martin H. "message authentication code." In Computer Science and Communications Dictionary, 1003. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_11364.

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

Bernstein, Daniel J. "The Poly1305-AES Message-Authentication Code." In Fast Software Encryption, 32–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11502760_3.

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

Bakhtiari, S., R. Safavi-Naini, and J. Pieprzyk. "A message authentication code based on latin squares." In Information Security and Privacy, 194–203. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0027926.

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

Lu, Jiqiang, Zhigang Zhao, and Huaqun Guo. "White-Box Implementation of the KMAC Message Authentication Code." In Information Security Practice and Experience, 248–70. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34339-2_14.

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

Cary, Matthew, and Ramarathnam Venkatesan. "A Message Authentication Code Based on Unimodular Matrix Groups." In Advances in Cryptology - CRYPTO 2003, 500–512. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45146-4_29.

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

Yang, Feng, Cheng Zhong, and Danhua Lu. "Cross Message Authentication Code Based on Multi-core Computing Technology." In Advances in Intelligent and Soft Computing, 181–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29387-0_28.

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

Alosaimy, Raed, Khaled Alghathbar, Alaaeldin M. Hafez, and Mohamed H. Eldefrawy. "NMACA Approach Used to Build a Secure Message Authentication Code." In Communications in Computer and Information Science, 290–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17610-4_34.

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

Blackburn, Simon R., and Kenneth G. Paterson. "Cryptanalysis of a Message Authentication Code due to Cary and Venkatesan." In Fast Software Encryption, 446–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25937-4_28.

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

Conference papers on the topic "Message authentication code (MAC)"

1

Echandouri, Bouchra, Charifa Hanin, Fouzia Omary, and Souad Elbernoussi. "LCAHASH-MAC: A new lightweight message authentication code using cellular automata for RFID." In 2017 International Conference on Wireless Networks and Mobile Communications (WINCOM). IEEE, 2017. http://dx.doi.org/10.1109/wincom.2017.8238158.

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

Lan, Jingjing, Jun Zhou, and Xin Liu. "An area-efficient implementation of a Message Authentication Code (MAC) algorithm for cryptographic systems." In TENCON 2016 - 2016 IEEE Region 10 Conference. IEEE, 2016. http://dx.doi.org/10.1109/tencon.2016.7848369.

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

Sihite, Alfonso Brolin, and Muhammad Salman. "E-Voting and e-Recap Verification and Validation Schemes for Indonesia Utilizing Cryptographic Hash Function Message Authentication Codes (MAC) and Public Key Infrastructure (PKI)." In 2019 International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS). IEEE, 2019. http://dx.doi.org/10.1109/icimcis48181.2019.8985212.

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

Goll, Martin, and Shay Gueron. "Vectorization of Poly1305 Message Authentication Code." In 2015 12th International Conference on Information Technology - New Generations (ITNG). IEEE, 2015. http://dx.doi.org/10.1109/itng.2015.28.

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

Van, Dang Hai, and Nguyen Dinh Thuc. "A Privacy Preserving Message Authentication Code." In 2015 5th International Conference on IT Convergence and Security (ICITCS). IEEE, 2015. http://dx.doi.org/10.1109/icitcs.2015.7292927.

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

Jun He and Hai-feng Qian. "Forward-secure aggregate message authentication code." In IET International Communication Conference on Wireless Mobile & Computing (CCWMC 2009). IET, 2009. http://dx.doi.org/10.1049/cp.2009.2044.

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

Chen, Dajiang, Shaoquan Jiang, and Zhiguang Qin. "Message Authentication Code over a wiretap channel." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282866.

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

Michail, H. E., A. P. Kakarountas, G. Selimis, and C. E. Goutis. "Throughput Optimization of the Cipher Message Authentication Code." In 2007 15th International Conference on Digital Signal Processing. IEEE, 2007. http://dx.doi.org/10.1109/icdsp.2007.4288627.

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

Rashwan, A. M., A.-E. M. Taha, and H. S. Hassanein. "Benchmarking message authentication code functions for mobile computing." In GLOBECOM 2012 - 2012 IEEE Global Communications Conference. IEEE, 2012. http://dx.doi.org/10.1109/glocom.2012.6503506.

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

Ullah, Ikram, Nirvana Meratnia, and Paul J. M. Havinga. "iMAC: Implicit Message Authentication Code for IoT Devices." In 2020 IEEE 6th World Forum on Internet of Things (WF-IoT). IEEE, 2020. http://dx.doi.org/10.1109/wf-iot48130.2020.9221331.

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

Reports on the topic "Message authentication code (MAC)"

1

Smid, Miles E., Elaine Barker, David Balenson, and Martha Haykin. Message authentication code (MAC) validation system. Gaithersburg, MD: National Bureau of Standards, 1988. http://dx.doi.org/10.6028/nbs.sp.500-156.

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

Gutmann, P. Using Message Authentication Code (MAC) Encryption in the Cryptographic Message Syntax (CMS). RFC Editor, January 2012. http://dx.doi.org/10.17487/rfc6476.

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

Dolmatov, V., ed. GOST 28147-89: Encryption, Decryption, and Message Authentication Code (MAC) Algorithms. RFC Editor, March 2010. http://dx.doi.org/10.17487/rfc5830.

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

Ovsienko, D. Babel Hashed Message Authentication Code (HMAC) Cryptographic Authentication. RFC Editor, July 2014. http://dx.doi.org/10.17487/rfc7298.

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

Krovetz, T., ed. UMAC: Message Authentication Code using Universal Hashing. RFC Editor, March 2006. http://dx.doi.org/10.17487/rfc4418.

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

Malhotra, A., and S. Goldberg. Message Authentication Code for the Network Time Protocol. RFC Editor, June 2019. http://dx.doi.org/10.17487/rfc8573.

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

Sorce, S., and T. Yu. Kerberos Authorization Data Container Authenticated by Multiple Message Authentication Codes (MACs). RFC Editor, March 2016. http://dx.doi.org/10.17487/rfc7751.

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

Eastlake, D. HMAC SHA (Hashed Message Authentication Code, Secure Hash Algorithm) TSIG Algorithm Identifiers. RFC Editor, August 2006. http://dx.doi.org/10.17487/rfc4635.

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

McGrew, D., and J. Viega. The Use of Galois Message Authentication Code (GMAC) in IPsec ESP and AH. RFC Editor, May 2006. http://dx.doi.org/10.17487/rfc4543.

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

Schaad, J., and R. Housley. Wrapping a Hashed Message Authentication Code (HMAC) key with a Triple-Data Encryption Standard (DES) Key or an Advanced Encryption Standard (AES) Key. RFC Editor, May 2003. http://dx.doi.org/10.17487/rfc3537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Message authentication code (MAC)' for particular source types:
Journal articles
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