92 research outputs found

    Printed document integrity verification using barcode

    Get PDF
    Printed documents are still relevant in our daily life and information in it must be protected from threats and attacks such as forgery, falsification or unauthorized modification. Such threats make the document lose its integrity and authenticity. There are several techniques that have been proposed and used to ensure authenticity and originality of printed documents. But some of the techniques are not suitable for public use due to its complexity, hard to obtain special materials to secure the document and expensive. This paper discuss several techniques for printed document security such as watermarking and barcode as well as the usability of two dimensional barcode in document authentication and data compression with the barcode. A conceptual solution that are simple and efficient to secure the integrity and document sender's authenticity is proposed that uses two dimensional barcode to carry integrity and authenticity information in the document. The information stored in the barcode contains digital signature that provides sender's authenticity and hash value that can ensure the integrity of the printed document

    Currency security and forensics: a survey

    Get PDF
    By its definition, the word currency refers to an agreed medium for exchange, a nation’s currency is the formal medium enforced by the elected governing entity. Throughout history, issuers have faced one common threat: counterfeiting. Despite technological advancements, overcoming counterfeit production remains a distant future. Scientific determination of authenticity requires a deep understanding of the raw materials and manufacturing processes involved. This survey serves as a synthesis of the current literature to understand the technology and the mechanics involved in currency manufacture and security, whilst identifying gaps in the current literature. Ultimately, a robust currency is desire

    The Impact of the theoretical properties of the Logistic Function on the generation of optically detectable watermarks

    Get PDF
    A digital watermark is a visible, or preferably invisible, identification code that is permanently embedded in digital media, to prove owner authentication and provide protection for security or defence documents.In this paper, we present an approach for the generation of watermarks using a logistic chaotic function. Using this function in conjunction with seed management, it is possible to generate chaotic sequences that may be used to create highpass or lowpass digital watermarks. A slight change in the initial conditions will quickly lead to a significant change in the subsequent states of the system, and thus will generate substantially different watermarks. This technique has been shown to offer an added security advantage over the more traditionally generated watermarks created from pseudorandom sequences, in that only the function seed needs to be stored. We have previously presented a study where an optical correlator was suitable for the detection of chaotically generated watermarks.We have also studied the impact of shot noise present in an optical detector for watermarks generated using the logistic function. The logistic function presented in this paper is ill-defined for certained seed values and has not been fully investigated for the purpose of watermark generation. We consider the impact of the theoretical properties of the logistic function on watermark generation and their highpass and lowpass properties, which when embedded in digital media, are suitable for optical detection

    Digital rights management for electronic documents

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Technological innovations and the work of the accounting historian: Some key issues

    Get PDF
    This paper considers how innovations in information technology have changed the process by which accounting historians collect primary and secondary sources of information. It examines how web-based systems have made it possible for historians to collect data from what is effectively a twenty-four-hour on-line library. The paper explores some of the limitations of technological innovations and considers the steps necessary to ensure future access to information stored in digital electronic form. It also considers the challenges involved in authenticating primary source documents such as e-mail and facsimiles and the impact of encryption on the availability of data in the future. Advances in information technology suggest that future generations of accounting historians will require new skills

    Forgery detection using chaotic watermarking in image key areas

    Get PDF
    U radu proučavamo algoritam za nanošenje vodenog žiga na komprimiranim slikama u primjeni protiv falsifikata na novčanicama. Najprije se proučava osnovni algoritam za nanošenje vodenog žiga na osnovu informacije o rubu slike. Šifrirani vodeni žig se pretvara u binarne vrijednosti i ugrađuje u rubove, a u međuvremenu se originalni oblik ruba štiti od vidljivog uništenja. Zatim se uz pomoć flip-invariantnih SIFT karakteristika lokalizira ključno područje sadržaja poput brojki i slova na slici. Treće, primjenjuju se Tent mapa i hash funkcija u daljnjoj zaštiti tajnog vodenog žiga. Svojstvo Tent mape osiguralo je osjetljivost na promjene u početnoj vrijednosti. Stoga možemo bolje zaštititi i prikriti originalni vodeni žig. Izvršenje operacija na binarno kodiranoj slici zasniva se na kodiranim nizovima dobivenim iz kaotične mape. Odabrane su razne operacije kako bi se generirao robustni prikriveni vodeni žig. Konačno smo verificirali naš algoritam u otkrivanju falsifikata. Istraživala se i osjetljivost prema tajnim ključnim vrijednostima. Predloženi je sustav osjetljiv na ključne vrijednosti pa učinkovito štiti vodeni žig od napada. Trošak izračuna se također mjerio u praktičnoj primjeni kaotičkog vodenog žiga. Eksperimentalni rezultati pokazuju da je predložena metoda pouzdano učinkovita.In this paper we study watermarking algorithm for compressed images in the application of antiforgery in financial bills. First, the basic watermarking algorithm based on image edge information is studied. The encrypted watermark is converted into binary values and embedded into the edges, meanwhile the original edge shape is preserved from noticeable destruction. Second, the flip-invariant SIFT features are used to localize the key content area like digits and letters in the image. Third, Tent map and a hash function is used to further protect the secrete watermark. The property of Tent map ensured the sensitivity towards changes in the initial value. Therefore we can better protect and encrypt the original watermark. The operations performing on the binary coded image are based on the encryption sequences generated from chaotic map. Different operations are chosen to generate robust encrypted watermark. Finally, we verify our algorithm in antiforgery detection. The sensitivity towards secrete key values is further investigated. The proposed system is sensitive to the key values, hence it effectively protects the watermark from attack. The computational cost is also measured for practical application of the chaotic watermarking. Experimental results show that the proposed method is reliably efficient

    Digital watermarking methods for data security and authentication

    Get PDF
    Philosophiae Doctor - PhDCryptology is the study of systems that typically originate from a consideration of the ideal circumstances under which secure information exchange is to take place. It involves the study of cryptographic and other processes that might be introduced for breaking the output of such systems - cryptanalysis. This includes the introduction of formal mathematical methods for the design of a cryptosystem and for estimating its theoretical level of securit

    A Covert Encryption Method for Applications in Electronic Data Interchange

    Get PDF
    A principal weakness of all encryption systems is that the output data can be ‘seen’ to be encrypted. In other words, encrypted data provides a ‘flag’ on the potential value of the information that has been encrypted. In this paper, we provide a new approach to ‘hiding’ encrypted data in a digital image. In conventional (symmetric) encryption, the plaintext is usually represented as a binary stream and encrypted using an XOR type operation with a binary cipher. The algorithm used is ideally designed to: (i) generate a maximum entropy cipher so that there is no bias with regard to any bit; (ii) maximize diffusion in terms of key dependency so that a change in any bit of the key can effect any, and potentially all, bits of the cipher. In the work reported here, we consider an approach in which a binary or low-bit plaintext image is encrypted with a decimal integer or floating point cipher using a convolution operation and the output quantized into a 1-bit array generating a binary image ciphertext. This output is then ‘embedded’ in a host image to hide the encrypted information. Embedding is undertaken either in the lowest 1-bit layer or multiple 1-bit layers. Decryption is accomplished by: (i) extracting the binary image from the host image; (ii) correlating the result with the original cipher. In principle, any cipher generator can be used for this purpose and the method has been designed to operate with 24-bit colour images. The approach has a variety of applications and, in this paper, we focus on the authentication and self-authentication of e-documents (letters and certificates, for example) that are communicated over the Internet and are thereby vulnerable to attack (e.g. modification, editing, counterfeiting etc.). In addition to document authentication, the approach considered provides a way of propagating disinformation and a solution to scenarios that require ‘plausible deniability’

    Dynamic block encryption with self-authenticating key exchange

    Get PDF
    One of the greatest challenges facing cryptographers is the mechanism used for key exchange. When secret data is transmitted, the chances are that there may be an attacker who will try to intercept and decrypt the message. Having done so, he/she might just gain advantage over the information obtained, or attempt to tamper with the message, and thus, misguiding the recipient. Both cases are equally fatal and may cause great harm as a consequence. In cryptography, there are two commonly used methods of exchanging secret keys between parties. In the first method, symmetric cryptography, the key is sent in advance, over some secure channel, which only the intended recipient can read. The second method of key sharing is by using a public key exchange method, where each party has a private and public key, a public key is shared and a private key is kept locally. In both cases, keys are exchanged between two parties. In this thesis, we propose a method whereby the risk of exchanging keys is minimised. The key is embedded in the encrypted text using a process that we call `chirp coding', and recovered by the recipient using a process that is based on correlation. The `chirp coding parameters' are exchanged between users by employing a USB flash memory retained by each user. If the keys are compromised they are still not usable because an attacker can only have access to part of the key. Alternatively, the software can be configured to operate in a one time parameter mode, in this mode, the parameters are agreed upon in advance. There is no parameter exchange during file transmission, except, of course, the key embedded in ciphertext. The thesis also introduces a method of encryption which utilises dynamic blocks, where the block size is different for each block. Prime numbers are used to drive two random number generators: a Linear Congruential Generator (LCG) which takes in the seed and initialises the system and a Blum-Blum Shum (BBS) generator which is used to generate random streams to encrypt messages, images or video clips for example. In each case, the key created is text dependent and therefore will change as each message is sent. The scheme presented in this research is composed of five basic modules. The first module is the key generation module, where the key to be generated is message dependent. The second module, encryption module, performs data encryption. The third module, key exchange module, embeds the key into the encrypted text. Once this is done, the message is transmitted and the recipient uses the key extraction module to retrieve the key and finally the decryption module is executed to decrypt the message and authenticate it. In addition, the message may be compressed before encryption and decompressed by the recipient after decryption using standard compression tools
    corecore