Please use this identifier to cite or link to this item:
Title: Evolution of the e-Museum concept through exploitation of cryptographic algorithms
Authors: Ioannides, Marinos 
Michail, Harris 
Athanasiou, George S. 
Gregoriades, Andreas 
Keywords: Cryptography;Algorithms;Databases;Economic development
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: Oct-2012
Publisher: Springer
Source: (2012) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7616 LNCS, pp. 291-300; 4th International Conference on Cultural Heritage EuroMed, 2012, Limassol, Cyprus
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 
Conference: International Conference on Cultural Heritage EuroMed 
Abstract: Nowadays more and more modern museums have digitized their collections and created e-museums. In this paper, a novel framework for enhancing the concept of e-Museum is proposed. The framework is based on cryptographic algorithms, specifically hash functions and block ciphers. The first are used for continuous hashing and digest matching of the database's contents for quality assurance. The block ciphers are used so as to enable on-line selling, through encryption of the digital object and offering the resulted ciphertext. The system's infrastructure that implements the above framework is also described. It has to be stressed that it is the first time that cryptographic principles are exploited this way in the Cultural Heritage domain.
ISBN: 978-364234233-2
ISSN: 0302-9743
DOI: 10.1007/978-3-642-34234-9_29
Rights: © 2012 Springer
Type: Conference Papers
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Show full item record


checked on Apr 28, 2018

Page view(s) 50

Last Week
Last month
checked on Sep 19, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.