Personal data is highly vulnerable to security exploits, spurring moves to lock it down through encryption, to cryptographically ‘cloud’ it. But personal data is also highly valuable to corporations and states, triggering moves to unlock its insights by relocating it in the cloud. We characterise this twinned condition as ‘clouded data’. Clouded data constructs a political and technological notion of privacy that operates through the intersection of corporate power, computational resources and the ability to obfuscate, (...) gain insights from and valorise a dependency between public and private. First, we survey prominent clouded data approaches, suggesting their particular affordances produce distinctive versions of privacy. Next, we perform two notional code-based experiments using synthetic datasets. In the field of health, we submit a patient’s blood pressure to a notional cloud-based diagnostics service; in education, we construct a student survey that enables aggregate reporting without individual identification. We argue that these technical affordances legitimate new political claims to capture and commodify personal data. The final section broadens the discussion to consider the political force of clouded data and its reconstitution of traditional notions such as the public and the private. (shrink)

BackgroundIncreasingly, hospitals and research institutes are developing technical solutions for sharing patient data in a privacy preserving manner. Two of these technical solutions are homomorphic encryption and distributed ledger technology. Homomorphic encryption allows computations to be performed on data without this data ever being decrypted. Therefore, homomorphic encryption represents a potential solution for conducting feasibility studies on cohorts of sensitive patient data stored in distributed locations. Distributed ledger technology provides a permanent record on (...) all transfers and processing of patient data, allowing data custodians to audit access. A significant portion of the current literature has examined how these technologies might comply with data protection and research ethics frameworks. In the Swiss context, these instruments include the Federal Act on Data Protection and the Human Research Act. There are also institutional frameworks that govern the processing of health related and genetic data at different universities and hospitals. Given Switzerland’s geographical proximity to European Union (EU) member states, the General Data Protection Regulation (GDPR) may impose additional obligations.MethodsTo conduct this assessment, we carried out a series of qualitative interviews with key stakeholders at Swiss hospitals and research institutions. These included legal and clinical data management staff, as well as clinical and research ethics experts. These interviews were carried out with two series of vignettes that focused on data discovery using homomorphic encryption and data erasure from a distributed ledger platform.ResultsFor our first set of vignettes, interviewees were prepared to allow data discovery requests if patients had provided general consent or ethics committee approval, depending on the types of data made available. Our interviewees highlighted the importance of protecting against the risk of reidentification given different types of data. For our second set, there was disagreement amongst interviewees on whether they would delete patient data locally, or delete data linked to a ledger with cryptographic hashes. Our interviewees were also willing to delete data locally or on the ledger, subject to local legislation.ConclusionOur findings can help guide the deployment of these technologies, as well as determine ethics and legal requirements for such technologies. (shrink)

There is a tendency in decision‐making research to treat uncertainty only as a problem to be overcome. But it is also a feature that can be leveraged, particularly in social interaction. Comparing the behavior of profitable and unprofitable poker players, we reveal a strategic use of information processing that keeps decision makers unpredictable. To win at poker, a player must exploit public signals from others. But using public inputs makes it easier for an observer to reconstruct that player's strategy and (...) predict his or her behavior. How should players trade off between exploiting profitable opportunities and remaining unexploitable themselves? Using a recent multivariate approach to information theoretic data analysis and 1.75 million hands of online two‐player No‐Limit Texas Hold'em, we find that the important difference between winning and losing players is not in the amount of information they process, but how they process it. In particular, winning players are better at integrative information processing—creating new information from the interaction between their cards and their opponents’ signals. We argue that integrative information processing does not just produce better decisions, it makes decision‐making harder for others to reverse engineer, as an expert poker player's cards act like the private key in public‐key cryptography. Poker players encrypt their reasoning with the way they process information. The encryption function of integrative information processing makes it possible for players to exploit others while remaining unexploitable. By recognizing the act of information processing as a strategic behavior in its own right, we offer a detailed account of how experts use endemic uncertainty to conceal their intentions in high‐stakes competitive environments, and we highlight new opportunities between cognitive science, information theory, and game theory. (shrink)

With the development of mobile communication technology, location-based services are booming prosperously. Meanwhile privacy protection has become the main obstacle for the further development of LBS. The k-nearest neighbor search is one of the most common types of LBS. In this paper, we propose an efficient private circular query protocol with high accuracy rate and low computation and communication cost. We adopt the Moore curve to convert two-dimensional spatial data into one-dimensional sequence and encrypt the points of interest information (...) with the Brakerski-Gentry-Vaikuntanathan homomorphic encryption scheme for privacy-preserving. The proposed scheme performs the secret circular shift of the encrypted POIs information to hide the location of the user without a trusted third party. To reduce the computation and communication cost, we dynamically divide the table of the POIs information according to the value of k. Experiments show that the proposed scheme provides high accuracy query results while maintaining low computation and communication cost. (shrink)

The Snowden revelations in 2013 redrew the lines of debate surrounding surveillance, exposing the extent of state surveillance across multiple nations and triggering legislative reform in many. In the UK, this was in the form of the Investigatory Powers Act. As a contribution to understanding resistance to expanding state surveillance activities, this article reveals the intertwining of diverse interests and voices which speak in opposition to UK state surveillance. Through a computational topic modelling-based mixed methods analysis of the submissions made (...) to the draft Investigatory Powers Bill consultation, the article demonstrates the diversity and intersection of discourses within different actor groups, including civil society and the technology industry. We demonstrate that encryption is a key issue for these groups, and is additionally conflated with a human rights discourse. This serves to unite seemingly disparate interests by imbuing encryption with a responsibility for the protection of human rights, but also threatens to legitimate corporate interests and distract from their own data-driven activities of surveillance capitalism. (shrink)

This paper addresses the always online behavior of the data owner in proxy re- encryption schemes for re-encryption keys issuing. We extend and adapt multi-authority ciphertext policy attribute based encryption techniques to type-based proxy re-encryption to build our solution. As a result, user authentication and user authorization are moved to the cloud server which does not require further interaction with the data owner, data owner and data users identities are hidden from the (...) cloud server, and re-encryption keys are only issued to legitimate users. An in depth analysis shows that our scheme is secure, flexible and efficient for mobile cloud computing. (shrink)

Image data play important role in various real-time online and offline applications. Biomedical field has adopted the imaging system to detect, diagnose, and prevent several types of diseases and abnormalities. The biomedical imaging data contain huge information which requires huge storage space. Moreover, currently telemedicine and IoT based remote health monitoring systems are widely developed where data is transmitted from one place to another. Transmission of this type of huge data consumes more bandwidth. Along with this, (...) during this transmission, the attackers can attack the communication channel and obtain the important and secret information. Hence, biomedical image compression and encryption are considered the solution to deal with these issues. Several techniques have been presented but achieving desired performance for combined module is a challenging task. Hence, in this work, a novel combined approach for image compression and encryption is developed. First, image compression scheme using wavelet transform is presented and later a cryptography scheme is presented using confusion and diffusion schemes. The outcome of the proposed approach is compared with various existing techniques. The experimental analysis shows that the proposed approach achieves better performance in terms of autocorrelation, histogram, information entropy, PSNR, MSE, and SSIM. (shrink)

With the increasing volume of data transmission through insecure communication channels, big data security has become one of the important concerns in the cybersecurity domain. To address these concerns and keep data safe, a robust privacy-preserving cryptosystem is necessary. Such a solution relies on chaos encryption algorithms over standard cryptographic methods that possess multistage encryption levels, including high speed, high security, low compute overheads, and procedural power, among other characteristics. In this work, a secure image (...) encryption scheme is proposed using linear feedback shift register and chaos-based quantum chaotic map. The focus of the scheme is mainly dependent on the secret keys from the input of the algorithm. The threat landscape, the statistical test analysis, along critical comparisons with other schemes indicate that the presented algorithm is significantly secure and is resistant to a wide range of different attacks such as differential and statistical attacks. The proposed method has sufficiently higher sensitivity and security when compared to existing encryption algorithms. Several security parameters validated the security of proposed work such as correlation coefficient analyses among the neighboring pixels, entropy, the number of pixels change rate, unified average change intensity, mean square error, brute force, key sensitivity, and peak signal to noise ratio analyses. The randomness of the ciphers produced by the proposed technique is also passed through NIST-800-22. The results of NIST indicate that the ciphers are highly random and do not produce any type of periodicity or pattern. (shrink)

Coordination of a power system with the phasor measurement devices in real time on the load and generation sides is carried out within the context of smart grid studies. Power systems equipped with information systems in a smart grid pace with external security threats. Developing a smart grid which can resist against cyber threats is considered indispensable for the uninterrupted operation. In this study, a two-way secure communication methodology underpinned by a chaos-based encryption algorithm for PMU devices is proposed. (...) The proposed system uses the IEEE-14 busbar system on which the optimum PMU placement has been installed. The proposed hyperchaotic system-based encryption method is applied as a new security methodology among PMU devices. The success of results is evaluated by the completeness of data exchange, durations, the complexity of encryption-decryption processes, and strength of cryptography using a microcomputer-based implementation. The results show that the proposed microcomputer-based encryption algorithms can be directly embedded as encryption hardware units into PMU and PDC devices which have very fast signal processing capabilities taking into considerations the acceptable delay time for power system protection and measuring applications and quality metering applications which is 2 ms and 10 ms, respectively. While proposed algorithms can be used in TCP or UDP over IP-based IEEE C37.118, IEC 61850, and IEC 61850-90-5 communication frameworks, they can also be embedded into electronic cards, smartcards, or smart tokens which are utilized for authentication among smart grid components. (shrink)

The study of conversational humor has received relatively little empirical attention with almost no examinations of the role of vocal signals in spontaneous humor production. Here we report an analysis of spontaneous humorous speech in a rural Brazilian collective farm. The sample was collected over the course of ethnographic fieldwork in northeastern Brazil, and is drawn specifically from the monthly communal business meetings conducted in Portuguese. Our analyses focused on humorous utterances identified by the subsequent presence of laughter. Acoustic features (...) of these utterances were compared to non-humorous utterances by the same speakers of similar length and immediately preceding them to look for prosodic contrasts. This corpus provided a unique opportunity for examining the way people mark their humorous productions in a non-humorous environment. Contrary to the notion that speakers must mark their production of humor in order to facilitate audience understanding, no significant marking of a joking “frame” was detected across a range of acoustic dimensions. The only consistent difference — that the set-up and punch line segments were louder than baseline speech before it — does not well support a marking hypothesis and more likely reflects speaker adjustments to the acoustic conditions of the meeting hall. We present these data from the perspective of the encryption theory of humor that predicts speakers will not generally mark spontaneous, conversational humor in most contexts. (shrink)

The Snowden leaks, first published in June 2013, provided unprecedented insights into the operations of state-corporate surveillance, highlighting the extent to which everyday communication is integrated into an extensive regime of control that relies on the ‘datafication’ of social life. Whilst such data-driven forms of governance have significant implications for citizenship and society, resistance to surveillance in the wake of the Snowden leaks has predominantly centred on techno-legal responses relating to the development and use of encryption and policy (...) advocacy around privacy and data protection. Based on in-depth interviews with a range of social justice activists, we argue that there is a significant level of ambiguity around this kind of anti-surveillance resistance in relation to broader activist practices, and critical responses to the Snowden leaks have been confined within particular expert communities. Introducing the notion of ‘data justice’, we therefore go on to make the case that resistance to surveillance needs to be conceptualized on terms that can address the implications of this data-driven form of governance in relation to broader social justice agendas. Such an approach is needed, we suggest, in light of a shift to surveillance capitalism in which the collection, use and analysis of our data increasingly comes to shape the opportunities and possibilities available to us and the kind of society we live in. (shrink)

The never ending growth of digital information and the availability of low-cost storage facilities and networks capacity is leading users towards moving their data to remote storage resources. Since users’ data often holds identity-related information, several privacy issues arise when data can be stored in untrusted domains. In addition digital identity management is becoming extremely complicated due to the identity replicas proliferation necessary to get authentication in different domains. GMail and Amazon Web Services, for instance, are two (...) examples of online services adopted by million of users throughout the world which hold huge amounts of sensitive users data. State-of-the-art encryption tools for large-scale distributed infrastructures allow users to encrypt content locally before storing it on a remote untrusted repository. This approach can experience performance drawbacks, when very large data-sets must be encrypted/decrypted on a single machine. The proposed approach extends the existing solutions by providing two additional features: (1) the encryption can also be delegated to a pool of remote trusted computing resources, and (2) the definition of the encryption context which drives the tool to select the best strategy to process the data. The performance benchmarks are based on the results of tests carried out both on a local workstation and on the Grid INFN Laboratory for Dissemination Activities (GILDA) testbed. (shrink)

As we move our social institutions from paper and ink based operations to the electronic medium, we invisibly create a type of surveillance society, a panopticon society. It is not the traditional surveillance society in which government officials follow citizens around because they are concerned about threats to the political order. Instead it is piecemeal surveillance by public and private organizations. Piecemeal though it is, It creates the potential for the old kind of surveillance on an even grander scale. The (...) panopticon is the prison environment described by Foucault in which prison cells are arranged in a large circle with the side facing the inside of the circle open to view. The guard tower is placed in the middle of the circle so that guards can see everything that goes on in every cell. When we contemplate all the electronic data that is now gathered about each of us as we move through our everyday lives --- intelligent highway systems, consumer transactions, traffic patterns on the internet, medical records, financial records, and so on --- there seems little doubt that we are moving into a panopticon. The social issues that arise from this are too numerous to detail here, but data retention is an important part of it. In the paper-and-ink world, documents are filed, files are boxed, boxes are put away or thrown away. The capacity for data retrieval and manipulation is, thereby, limited by the sheer difficulty and cost of storing, finding, searching, and manipulating large numbers of paper files. This inconvenience functions as a mechanism whereby the system forgets past information, not unlike the way we ourselves forget. However, the story is very different in the digital world; digital information is easy to store, easy to search and manipulate, and inexpensive to keep over extensive periods of time. Digitalized information systems tend, therefore, to collect extensive ancillary information and to retain this information indefinitely. Such lack of forgetfulness is likely to hamper the ability of individuals to shed their past, and start over with a clean slate. Concerns about data retention were expressed in the early literature on the social impact of computing, but for the most part the issue has dropped from sight. Rarely, has the social good of discarding accumulated personal data been addressed. In this paper, we want to make the case by examining diverse cases in which retention of information by either business or governmental institutions hinders the ability of individuals to start over or to act autonomously. We hope our argument for the good of forgetfulness will challenge the standard framework in which such issues have traditionally been debated. The privacy debate exemplifies the traditional framework insofar as it has been characterized as involving an inherent tension between, on the one hand, the needs of organizations and institutions for more accurate and efficient information systems so as to further their goals and, on the other hand, the desire of individuals to have information about them kept private. Regan argues against this framing of the privacy issue in favor of one that recognizes the social importance of personal privacy. We will examine the non-forgetfulness of information systems as a problem threatening not just individual interests but social good as well. Cryptography is often cited as the technology that will give us privacy and mediate against surveillance. One of the uses of cryptography, encryption, will allow us, some hope, to create confidentiality and relationships of trust that will facilitate many of the social arrangements we now have and perhaps make them even more secure than they are now. Electronic cash, for example, could be created in such a form that it would have the anonymity associated now with hard cash Others are less optimistic of the potential for cryptography to re-create relationships of trust in the new medium. One important point that already seems clear is that even if encryption technology will protect the confidentiality and integrity of electronic transactions and data, it will NOT stop the observation of traffic patterns on networks. This seems an important distinction to put on the table. Our patterns of communication will continue to be available, no matter what is encrypted, and an amazing amount of information can be gleaned from this data. In a sense, it means content integrity but no anonymity. This will indubitably impact how we interact and with whom we interact. (shrink)

Recent large-scale personal data loss incidents highlighted the need for public bodies to more securely handle confidential data. We surveyed trainees from all specialties in the Welsh Deanery for their knowledge and practice. All registered trainees were invited to participate in an online anonymised survey. There were 880 completed and non-duplicated responses (52.9% response rate). Responses were analysed using Microsoft Access. Over 40% (388/880 (44.1%)) did not use formal guidelines on storage or disposal of confidential data. The (...) majority appeared to dispose of confidential paper documents securely, that is, using shredders and white shredder bags. However, there were significant numbers of unmarked responses. Clinical documents, such as theatre lists, were taken home by 281/880 (31.9%) of trainees. The majority secured their computers (569/871 (65.3%)) by either not keeping patient identifiable data on them or using encryption. However, 302/871 (34.7%) did not adequately secure their computers. The surgical and anaesthetic specialties were least aware of formal confidentiality guidelines (95/178 (53.4%)) and 52/102 (51.0%) respectively) and least secured their computers (106/178 (59.6%) and 63/102 (61.8%) respectively). Education is needed to improve knowledge and practice of confidential data handling. This may be delivered through workshops during induction programmes or as part of European Computer Driving Licence (ECDL) modules. Training is especially indicated for the surgical and anaesthetic specialties. (shrink)

IntroductionInformation and communication technologies are becoming an integral part of medical practice, research and administration and their use will grow as telemedicine and electronic medical record use become part of routine practice. Security in maintaining patient data is important and there is a statuary obligation to do so, but few health professionals have been trained on how to achieve this. There is no information on the use of computers and email by doctors and nurses in South Africa in the (...) workplace and at home, and whether their current computer practices meets legal and ethical requirements. The aims of this study were to determine the use of computers by healthcare practitioners in the workplace and home; the use and approach to data storage, encryption and security of patient data and patient email; and the use of informed consent to transmit data by email.MethodsA self-administered questionnaire was administered to 400 health care providers from the state and private health care sectors. The questionnaire covered computer use in the workplace and at home, sharing of computers, data encryption and storage, email use, encryption of emails and storage, and the use of informed consent for email communication.Results193 doctors and 207 nurses in the private and public sectors completed the questionnaire. Forty (10%) of participants do not use a computer. A third of health professionals were the only users of computers at work or at home. One hundred and ninety-eight respondents (55%) did not know if the data on the computers were encrypted, 132 (36.7%) knew that the data were not encrypted and 30 (8.3%) individuals knew that the data on the computers they were using were encrypted. Few doctors, 58 (16%), received emails from patients, with doctors more likely to receive emails from patients than nurses (p = 0.0025). Thirty-one percent of individuals did not respond to the emails. Emails were saved by 40 (69%) recipients but only 5 (12.5%) doctors encrypted the messages, 19 (47.5%) individuals knowingly did not encrypt and 16 (40.0%) did not know if they encrypted the data. While 20% of health professionals have emailed patient data, but only 41.7% gained consent to do so.ConclusionsMost health professionals as sampled in South Africa are not compliant with the National Health Act or the Electronic Communications Transactions Act of South Africa or guidelines from regulatory bodies when managing patient data on computers. Many appear ignorant or lack the ability to comply with simple data security procedures. (shrink)

Written in a relaxed, readable style, A Concise Introduction to Pure Mathematics leads students gently but firmly into the world of higher mathematics. It provides beginning undergraduates with a rigourous grounding in the basic tools and techniques of the discipline and prepares them for further more advanced studies in analysis, differential equations, and algebra. This edition contains additional material on secret codes, permutations, and prime numbers. It features more than 200 exercises, with many completely new. The text is organized into (...) relatively independent chapters, allowing instructors to tailor the book to meet their individual course needs. · Contains extra material concerning prime numbers, forming the basis for data encryption · Explores "Secret Codes" - one of today's most spectacular applications of pure mathematics Discusses Permutations and their importance in many topics in discrete mathematics. (shrink)

This paper provides an in-depth analysis and discussion of the key issues of quality management, evaluation, and detection contained in big data for automotive application scenarios. A generalized big data quality management model and programming framework are proposed, and a series of data quality detection and repair interfaces are built to express the processing semantics of various data quality issues. Through this data quality management model and detection and repair interfaces, users can quickly build custom (...) data quality detection and repair tasks for different data quality requirements. To improve the operational efficiency of complex data quality management algorithms in large-scale data scenarios, corresponding parallelization algorithms are studied and implemented for detection and repair algorithms with long computation time, including priority-based multiconditional function-dependent detection and repair algorithms, entity detection, and extraction algorithms based on semantic information and chunking techniques, and plain Bayesian-based missing value filling algorithms, and this paper proposes a data validity evaluation algorithm and enhances the validity of the original data in practical applications by adding temporal weights, and finally it passed the experimental validation. Through the comprehensive detection process of data importance, network busyness, duration of transmission process, and failure situation, the efficiency has been increased by 20%, and an adaptive data integrity detection method based on random algorithm and encryption algorithm is designed. After experimental verification, this method can effectively detect the integrity of the data transmission process and improve the application of data value, and the final effect is increased by 30.5%. (shrink)

Using mathematical tools from number theory and finite fields, Applied Algebra: Codes, Ciphers, and Discrete Algorithms, Second Edition presents practical methods for solving problems in data security and data integrity. It is designed for an applied algebra course for students who have had prior classes in abstract or linear algebra. While the content has been reworked and improved, this edition continues to cover many algorithms that arise in cryptography and error-control codes. New to the Second Edition A CD-ROM (...) containing an interactive version of the book that is powered by Scientific Notebook®, a mathematical word processor and easy-to-use computer algebra system New appendix that reviews prerequisite topics in algebra and number theory Double the number of exercises Instead of a general study on finite groups, the book considers finite groups of permutations and develops just enough of the theory of finite fields to facilitate construction of the fields used for error-control codes and the Advanced Encryption Standard. It also deals with integers and polynomials. Explaining the mathematics as needed, this text thoroughly explores how mathematical techniques can be used to solve practical problems. About the Authors Darel W. Hardy is Professor Emeritus in the Department of Mathematics at Colorado State University. His research interests include applied algebra and semigroups. Fred Richman is a professor in the Department of Mathematical Sciences at Florida Atlantic University. His research interests include Abelian group theory and constructive mathematics. Carol L. Walker is Associate Dean Emeritus in the Department of Mathematical Sciences at New Mexico State University. Her research interests include Abelian group theory, applications of homological algebra and category theory, and the mathematics of fuzzy sets and fuzzy logic. (shrink)

Smart grids are designed to revolutionize the energy sector by creating a smarter, more efficient and reliable power supply network. The rise of smart grids is a response to the need for a more comprehensive and sophisticated energy system that caters to the needs of homes and businesses. Key features of smart grids include the integration of renewable energy sources, decentralized generation and advanced distribution networks. At the heart of smart grids is a sophisticated metering system, consisting of intelligent electronic (...) devices that measure energy consumption and enable two-way communication between the utility company and the consumer. The information exchanged via these devices is critical, as it includes sensitive data such as energy consumption patterns and billing information. With the rise of the Internet of Things (IoT) and Industry 4.0, the security of this information is of utmost importance. This paper delves into the security challenges faced by advanced metering infrastructure (AMI) and highlights the crucial role played by cryptography in ensuring the secure exchange of sensitive information. Cryptographic protocols such as encryption, authentication and digital signatures are essential components of a secure smart grid infrastructure. These protocols work together to ensure the confidentiality, integrity and authenticity of the information exchanged between the utility company and the consumer. (shrink)

—Industrial networks are increasingly based on open protocols and platforms that are also employed in the IT industry and Internet background. Most of the industries use wireless networks for communicating information and data, due to high cable cost. Since, the wireless networks are insecure, it is essential to secure the critical information and data during transmission. The data that transmitted is intercepted by eavesdropper can be predicted by secrecy capacity. The secrecy capacity is the difference between channel (...) capacity of main link and wiretap link of wireless transmission. When the secrecy capacity gets fades, then it is known that transmitted data is intercepted. In the event, of applying optimal sensor scheduling scheme a sensor with highest secrecy capacity is chosen and data is transmitted. It is followed with cooperative localization algorithm to enhance nodes, predict and maintain power of each sensor nodes. Through localization algorithm best sensor nodes are get predicted for transmission. Moreover, RC4 encryption and decryption algorithm is enhanced for data while transmission. This will enable protection to data to an extent. Also, an asymptotic intercept probability analysis is performed to provide an imminent into the impact of the sensor scheduling on the wireless security. (shrink)

As the world keeps advancing, the need for automated interconnected devices has started to gain significance; to cater to the condition, a new concept Internet of Things has been introduced that revolves around smart devicesʼ conception. These smart devices using IoT can communicate with each other through a network to attain particular objectives, i.e., automation and intelligent decision making. IoT has enabled the users to divide their household burden with machines as these complex machines look after the environment variables and (...) control their behavior accordingly. As evident, these machines use sensors to collect vital information, which is then the complexity analyzed at a computational node that then smartly controls these devicesʼ operational behaviors. Deep learning-based guessing attack protection algorithms have been enhancing IoT security; however, it still has a critical challenge for the complex industries’ IoT networks. One of the crucial aspects of such systems is the need to have a significant training time for processing a large dataset from the networkʼs previous flow of data. Traditional deep learning approaches include decision trees, logistic regression, and support vector machines. However, it is essential to note that this convenience comes with a price that involves security vulnerabilities as IoT networks are prone to be interfered with by hackers who can access the sensor/communication data and later utilize it for malicious purposes. This paper presents the experimental study of cryptographic algorithms to classify the types of encryption algorithms into the asymmetric and asymmetric encryption algorithm. It presents a deep analysis of AES, DES, 3DES, RSA, and Blowfish based on timing complexity, size, encryption, and decryption performances. It has been assessed in terms of the guessing attack in real-time deep learning complex IoT applications. The assessment has been done using the simulation approach and it has been tested the speed of encryption and decryption of the selected encryption algorithms. For each encryption and decryption, the tests executed the same encryption using the same plaintext for five separate times, and the average time is compared. The key size used for each encryption algorithm is the maximum bytes the cipher can allow. To the comparison, the average time required to compute the algorithm by the three devices is used. For the experimental test, a set of plaintexts is used in the simulation—password-sized text and paragraph-sized text—that achieves target fair results compared to the existing algorithms in real-time deep learning networks for IoT applications. (shrink)

The multifunctional zinc‐finger protein CCCTC‐binding factor (CTCF) is a very strong candidate for the role of coordinating the expression level of coding sequences with their three‐dimensional position in the nucleus, apparently responding to a “code” in the DNA itself. Dynamic interactions between chromatin fibers in the context of nuclear architecture have been implicated in various aspects of genome functions. However, the molecular basis of these interactions still remains elusive and is a subject of intense debate. Here we discuss the nature (...) of CTCF‐DNA interactions, the CTCF‐binding specificity to its binding sites and the relationship between CTCF and chromatin, and we examine data linking CTCF with gene regulation in the three‐dimensional nuclear space. We discuss why these features render CTCF a very strong candidate for the role and propose a unifying model, the “CTCF code,” explaining the mechanistic basis of how the information encrypted in DNA may be interpreted by CTCF into diverse nuclear functions. (shrink)

Advancements in digital technology have made it easy to alter faces using editing software, posing challenges for industries in verifying photograph authenticity. Digital image forensics, a scientific method, is employed to gather data and determine the veracity of faces. This study assesses the effectiveness of digital image forensics in detecting fake digital faces using tools such as Foto Forensics, Forensically Beta, and Opanda IExif. Foto Forensics analyzes JPEG picture compression levels to detect image edits, revealing metadata differences compared to (...) the original photo. Forensically Beta examines digital characteristics like color and noise levels to identify alterations. Opanda IExif scrutinizes image metadata, disclosing information about the camera used and subsequent changes. All three forensic methods effectively identify fake digital faces. Analyzing metadata differences and contrast variations between the original and altered faces proves to be an effective method for spotting alterations. Digital image forensics enhances legal and investigative processes, serving as a valuable tool for identifying digital face manipulation. Stronger digital security measures, including improved encryption, authentication, and legal regulations, are needed to protect against facial photograph manipulation. Updating legal and regulatory frameworks for digital security is vital to address increasingly sophisticated techniques used in facial photograph editing. As digital technology advances, continuous development and improvement of forensic techniques are crucial to detect digital face fabrication. Given the growing complexity of digital editing tools and the ease with which facial images can be altered, reliable methods are essential. Digital image forensics provides a systematic approach to gather data and verify the authenticity of digital photographs. (shrink)

The Mexico-U.S. border is a space considered `smart´ due to the amount of surveillance technology used for national security purposes. The technological ecology consists of integrated fixed towers, remote video surveillance systems, mobile video surveillance systems, Predator B surveillance drones, mobile X-ray units, automated license plate readers, cell phone tracking towers, implanted motion sensors, biometric data collection, and DNA sampling (Aizeki et al. Citation2021). Whilst these instruments are usually linked to irregular border crossers, transborder commuters, who physically cross the (...) border every day, also experience the same surveillance regime. This paper discusses the technological ‘self-defense’ protocol I developed in 2019 when conducting transborder research for my doctoral thesis, which required intense border crossings across Mexico and the U.S. During the ten months of fieldwork, U.S. CBP had the capacity to search my personal device and belongings without a warrant, raising ethical concerns about data protection. As a result, the protocol developed to protect data and participants considered the ‘smart’ border as part of the methods designed that included encrypting information. In hyper-surveilled spaces, data protection represents a challenge for border researchers and the people involved in such a project. (shrink)

Watermarking is one of the most common techniques used to protect data’s authenticity, integrity, and security. The obfuscation in the frequency domain used in the watermarking method makes the watermarking stronger than the obfuscation in the spatial domain. It occupies an important place in watermarking works in imperceptibility, capacity, and robustness. Finding the optimal location to hide the watermarking is one of the most challenging tasks in these methods and affects the method’s performance. In this article, sample identification information (...) is processed with the method of watermaking on the hiding environment created by using a chaos-based random number generator on biomedical data to provide solutions to problems such as visual attack, identity theft, and information confusion. In order to obtain biomedical data, a lensless digital in-line holographic microscopy setup was designed, and holographic data of human blood and cancer cell lines, which are widely used in the laboratory environment, were obtained. The standard USAF 1951 target was used to evaluate the resolution of our imaging setup. Various QR codes were generated for medical sample identification, and the captured medical data were processed by watermarking it with chaos-based random number generators. A new method using chaos-based discrete wavelet transform and singular value decomposition has been developed and applied to high-resolution data to eliminate the problem of encrypted data being directly targeted by third-party attacks. The performance of the proposed new watermarking method has been demonstrated by various robustness and invisibility tests. Experimental results showed that the proposed scheme reached an average PSNR value of 564588 dB and SSIM value of 0.9972 against several geometric and destructive attacks, which means that the proposed method does not affect the image quality and also ensures the security of the watermarking information. The results of the proposed method have shown that it can be used efficiently in various fields. (shrink)

The advent of quantum computing will compromise current asymmetric cryptography. Awaiting this moment, global superpowers are routinely collecting and storing encrypted data, so as to later decrypt it once sufficiently strong quantum computers are in place. We argue that this situation gives rise to a new mode of global surveillance that we refer to as a _quantum panopticon._ Unlike traditional forms of panoptic surveillance, the quantum panopticon introduces a _temporal axis_, whereby data subjects’ future pasts can be monitored (...) from an unknown “superposition” in the quantum future_._ It also introduces a new level of _uncertainty,_ in that the future watchman’s very existence becomes a function of data subjects’ efforts to protect themselves from being monitored in the present. Encryption may work as a momentary protection, but increases the likelihood of long-term preservation for future decryption, because encrypted data is stored longer than plaintext data. To illustrate the political and ethical aspects of these features, we draw on cryptographic as well as theoretical surveillance literature and call for urgent consideration of the wider implications of quantum computing for the global surveillance landscape. (shrink)

The impact of Online Social Networks on human lives is foreseen to be very large with unprecedented amount of data and users. OSN users share their ideas, photos, daily life events, feelings and news. Since OSNs’ security and privacy challenges are more potential than ever before, it is necessary to enhance the protection and filtering approaches of OSNs contents. This paper explores OSNs’ threats and challenges, and categorize them into: account-based, URL-based and content-based threats. In addition, we analyze the (...) existing protection methods and highlight their limitations and weaknesses. Based on that, we propose a comprehensive, user-level, proactive and real-time OSNs’ protection system, called Hybrid Real-time Social Networks Protector. HRSP has three components; a user-level security protocol and two classification models. The protocol defines a structure for OSN’s cryptographic services, including encryption, access control and users’ authentication. The classification models employ machine learning, black lists, white lists and users’ feedback, in order to classify URLs into: Benign, Risk and Inappropriate classes, and contents into: Benign, Hate speech and Inappropriate classes. We constructed two data sets of 150,000 URLs and 22,000 tweets to build and test the two classification models. Results show an overall accuracy of 93.2% for the URL model and 84.4% for the content model, while the protocol implementation produces compatible size and time overhead. The components of HRSP are integrated and have compatible design with OSN platforms. (shrink)

WikiLeaks is among the most controversial institutions of the last decade, and this essay contributes to an understanding of WikiLeaks by revealing the philosophical paradigm at the foundation of Julian Assange’s worldview: cypherpunk ethics. The cypherpunk movement emerged in the early-1990s, advocating the widespread use of strong cryptography as the best means for defending individual privacy and resisting authoritarian governments in the digital age. For the cypherpunks, censorship and surveillance were the twin evils of the computer age, but they viewed (...) encryption as a means to circumvent both. As a cypherpunk, Assange advocates for the use of cryptography in the fight for individual privacy as well as the fight for global justice. His cosmopolitan disposition is informed by his hacker background, antiwar principles, and Enlightenment outlook. This essay places Assange’s philosophical idea in historical context, exploring his views on censorship, surveillance, and the right to communicate. It also connects his cypherpunk principles to WikiLeaks, showing that the strategy of encouraging data leaks from powerful political and economic organizations is classic cypherpunk political praxis. (shrink)

Background: Moral philosophical positions and professional values have been shown to influence nurses’ practice behaviours. Understanding nursing students’ professional values and ethical ideologies, therefore, is important as they may help inform evidence-informed curriculum decisions and education strategies to develop students’ professional reflective competencies. However, there is a dearth in current empirical data on Canadian nursing students’ perceptions of professional values and ethical positions. Objectives: This study’s purpose was to examine undergraduate nursing student’s perceptions of professional values and ethical ideology (...) and explore relationships in data and selected participant demographic variables. Research design, participants and context: A descriptive cross-sectional research design was conducted with a convenience sample of undergraduate nursing students recruited from a university in Canada. An online encrypted survey consisting of two validated instruments was administered to participants who met study eligibility criteria. Descriptive and inferential statistics were employed to analyse the data and classify nursing students’ ethical ideologies into four categories based on mean scores for idealism and relativism. Ethical considerations: This study received ethical approval from the institutional Behavioural Research Ethics Board and was executed in-line with ethical principles for research involving humans. Findings: Nursing students scored high on professional values and ethical idealism and differed significantly on a measure of ethical relativism in terms of age and year of study. Professional values were significantly associated with ethical idealism. Based on mean scores for idealism and relativism, most nursing students in the study were classified as situationists. Discussion and conclusion: Findings suggest that faculty pay attention to influences of moral philosophical positions in facilitating nursing students’ professional values development. Implications for future research and curriculum are highlighted to strengthen nursing students’ professional values. (shrink)

This paper examines one particular problem of values in cloud computing: how individuals can take advantage of the cloud to store data without compromising their privacy and autonomy. Through the creation of Lockbox, an encrypted cloud storage application, we explore how designers can use reflection in designing for human values to maintain both privacy and usability in the cloud.

Anonymising technologies are cyber-tools that protect people from online surveillance, hiding who they are, what information they have stored and what websites they are looking at. Whether it is anonymising online activity through ‘TOR’ and its onion routing, 256-bit encryption on communications sent or smart phone auto-deletes, the user’s identity and activity is protected from the watchful eyes of the intelligence community. This represents a clear challenge to intelligence actors as it prevents them access to information that many would (...) argue plays a vital part in locating and preventing threats from being realised. Moreover, such technology offers more than ordinary information protections as it erects ‘warrant-proof’ spaces, technological black boxes that no matter what some authority might deem as being legitimately searchable is protected to the extent that there are very limited or non-existent means of forcing oneself in. However, it will be argued here that not only is using such anonymising technology and its extra layer of protection people’s right, but that it is ethically mandatory. That is, due to the en masse surveillance—from both governments and corporations—coupled with people’s limited awareness and ability to comprehend such data collections, anonymising technology should be built into the fabric of cyberspace to provide a minimal set of protections over people’s information, and in doing so force the intelligence community to develop more targeted forms of data collection. (shrink)

In the past decades, considerable attention has been paid to the chaos-based image encryption schemes owing to their characteristics such as extreme sensitivity to initial conditions and parameters, pseudo-randomness, and unpredictability. However, some schemes have been proven to be insecure due to using a single chaotic system. To increase the security, this work proposes a novel image encryption scheme based on the piecewise linear chaotic map and the standard map. To the best of our knowledge, it is the (...) first chaos-based image encryption scheme combining the PWLCM with the standard map, which adopts permutation-diffusion structure. Unlike the traditional scrambling way, a hierarchical diffusion strategy, which not only changes the pixel position but also modifies the value, is employed in the permutation phase. The operation model of row-by-row and column-by-column is further used to enhance the efficiency in the diffusion process. Consequently, a good trade-off efficiency and security can be achieved. Furthermore, the numerical simulations and performance analyses illustrate that the proposed encryption scheme can be used in practical application scenarios requiring lightweight security. (shrink)

The paper presents an approach to encrypt the color images using bit-level permutation and alternate logistic map. The proposed method initially segregates the color image into red, green, and blue channels, transposes the segregated channels from the pixel-plane to bit-plane, and scrambles the bit-plane matrix using Arnold cat map (ACM). Finally, the red, blue, and green channels of the scrambled image are confused and diffused by applying alternate logistic map that uses a four-dimensional Lorenz system to generate a pseudorandom number (...) sequence for the three channels. The parameters of ACM are generated with the help of Logistic-Sine map and Logistic-Tent map. The intensity values of scrambled pixels are altered by Tent-Sine map. One-dimensional and two-dimensional logistic maps are used for alternate logistic map implementation. The performance and security parameters histogram, correlation distribution, correlation coefficient, entropy, number of pixel change rate, and unified averaged changed intensity are computed to show the potential of the proposed encryption technique. (shrink)

The article deals with the algorithm of encrypting graphic information using transformation matrixes. It presents the actions that can be done with the image. The article also gives algorithms for forming matrixes that are created with the use of random processes. Examples of matrixes and encryption results are shown. Calculations of the analysis of combinations and conclusions to them are carried out. The article shows the possibilities and advantages of this image encryption algorithm. The proposed algorithm will allow (...) to transmit encrypted information through open communication channels. The algorithm uses all possible actions that can be done with the image, namely: image resizing, adding redundant elements to the image, changing the location of the pixels, changing the brightness of the image pixels, inverting the image pixels, changing the colours of the images pixels. A randomized approach to matrix formation will make it impossible to use neural systems. The algorithm of the implementation of writing encryption code is rather simple. It is not possible to decrypt the image without a key as the number of possible combinations is extremely large. This algorithm can be used in the military, intelligence, information security. Encryption does not require significant computing or RAM resources. This algorithm can be implemented in WEB-technology and in mobile applications, it has no recursive functions and loop in loop. The algorithm hides the image size, which in turn adds extra protection. Redundant elements will not allow neural networks to compare pixels. Changing colors, changing brightness, inversion by random processes will not allow neural networks to find the decryption function. The article considers an image encryption algorithm that will give a possibility to generate a key. The key will be a set of two-dimensional arrays formed in a randomized manner. A randomized approach to matrix formation will make it impossible to use neural systems. The algorithm uses all possible actions that can be done with the image, namely: Image resizing. Adding redundant elements to the image. Changing the location of the pixels. Changing the brightness of the image pixels. Inverting the image pixels. Changing the colours of the images pixels. The pixel positioning matrix gives us! combinations. The pixel brightness change matrix gives us 8 *! combinations. The pixel inversion matrix gives us 8 *! combinations. The pixel colour change matrix gives us 6 *! Combinations. The total number of combinations N is equal to: It is not possible to decrypt the image without a key as the number of possible combinations is extremely large. The algorithm of the implementation of writing encryption code is rather simple. This algorithm can be used in the military, intelligence, information security. The advantage of this algorithm is the fact that the encrypted image can be transmitted through open chann. (shrink)

Should all digital communication be accessible to government inspection? Is robust cryptography in the hands of the public a threat to our national security? With Dorothy Denning and Patrick Sullivan.

In this paper, we propose a new and simple method for image encryption. It uses an external secret key of 128 bits long and an internal secret key. The novelties of the proposed encryption process are the methods used to extract an internal key to apply the zigzag process, affine transformation, and substitution-diffusion process. Initially, an original gray-scale image is converted into binary images. An internal secret key is extracted from binary images. The two keys are combined to (...) compute the substitution-diffusion keys. The zigzag process is firstly applied on each binary image. Using an external key, every zigzag binary image is reflected or rotated and a new gray-scale image is reconstructed. The new image is divided into many nonoverlapping subblocks, and each subblock uses its own key to take out a substitution-diffusion process. We tested our algorithms on many biomedical and nonmedical images. It is seen from evaluation metrics that the proposed image encryption scheme provides good statistical and diffusion properties and can resist many kinds of attacks. It is an efficient and secure scheme for real-time encryption and transmission of biomedical images in telemedicine. (shrink)

Low-dimensional chaotic mappings are simple functions that have low computation cost and are easy to realize, but applying them in a cryptographic algorithm will lead to security vulnerabilities. To overcome this shortcoming, this paper proposes the coupled chaotic system, which coupled the piecewise and Henon mapping. Simulation results indicate that the novel mapping has better complexity and initial sensitivity and larger key space compared with the original mapping. Then, a new color image encryption algorithm is proposed based on the (...) new chaotic mapping. The algorithm has two processes: diffusion and confusion. In this scheme, the key is more than 2 216, and SSIM and PSNR are 0.009675 and 8.6767, respectively. The secret key is applied in the shuffling and diffusion. Security analysis indicates that the proposed scheme can resist cryptanalytic attacks. It has superior performance and has high security. (shrink)

Topic of quantum chaos has begun to draw increasing attention in recent years. So, to ensure the security of digital image, an image encryption algorithm based on combining a hyperchaotic system and quantum 3D logistic map is proposed. This algorithm is applied in four stages. Initially, the key generator builds upon the foundation of mean for any row or column of the edges of the plain image. Its output value is used to yield initial conditions and parameters of the (...) proposed image encryption scheme. Next, it diffuses the plain image by the random sequences generated by 3D hyperchaotic system, and the diffusion process is realized by implementing XOR operation. Then, the diffused image and chaotic sequences are produced by the 3D quantum chaotic logistic map, expressed as a quantum superposition state using density matrix which is a representation of the state of a quantum system, and finally the resulting quantum image is then confused and diffused simultaneously by a unitary matrix generated by logistic chaos using XNOR operation to obtain the final cipher image. Because of the dependence on the plain image, the algorithm can frustrate the chosen-plaintext and known-plaintext attacks. Simulation results and theoretical analysis verify that the presented scheme has high safety performance, a good encryption effect, and a large key space. The method can effectively resist exhaustive, statistical, and differential attacks. Moreover, the encryption time of the proposed method is satisfactory, and the method can be efficiently used in practice for the secure transmission of image information. (shrink)

Should all digital communication be accessible to government inspection? Is robust cryptography in the hands of the public a threat to our national security? With Dorothy Denning and Patrick Sullivan.

In this paper, we propose a method to design the pseudorandom number generator using three kinds of four-wing memristive hyperchaotic systems with different dimensions as multientropy sources. The principle of this method is to obtain pseudorandom numbers with good randomness by coupling XOR operation on the three kinds of FWMHSs with different dimensions. In order to prove its potential application in secure communication, the security of PRNG based on this scheme is analyzed from the perspective of cryptography. In addition, PRNG (...) has passed the NIST 800.22 and ENT test, which shows that PRNG has good statistical characteristics. Finally, an image encryption algorithm based on PRNG is adopted. In the encryption algorithm, the optimized Arnold matrix scrambling method and the diffusion processing based on XOR are used to obtain the final encrypted image. Through the evaluation of encryption performance, it is concluded that there is no direct relationship between the pristine image and encrypted image. The results show that the proposed image encryption scheme has good statistical output characteristics and security performance in line with cryptography. (shrink)

The two-dimensional coupled map lattice model has been extensively employed as the basis component for designing various schemes in the cryptography system due to its complicated chaotic dynamic behavior. In this study, we analyze the chaotic characteristics of the 2D CML model, such as the Lyapunov exponent, synchronization stability, bifurcation, and ergodicity. We then show that the chaotic sequences generated by the 2D CML model are random according to the NIST testing. Furthermore, we propose an image encryption scheme based (...) on the 2D CML model and Singular Value Decomposition. In our scheme, the SVD method is used to reduce the image storage, and the Red, Green, and Blue channels of a color image will be encrypted through confusion and diffusion. The simulation results, as well as the results of the comparison with other schemes, demonstrate that our scheme possesses outstanding statistics, excellent encryption performance, and high security. It has great potential for ensuring the security of digital images in real applications. (shrink)

In this paper, an efficient chaos-based image encryption scheme is proposed, which uses the imitating jigsaw method containing revolving and shifting operations. In this scheme, there are three processes in encryption: preprocessing, encryption process, and postprocessing. In the preprocessing, the original image is partitioned into 64 × 64 pixel image blocks and then randomly revolved and shifted under control sequences which are generated by the hyperchaotic Lorenz system whose initial conditions are calculated by original image and keys. (...) Therefore, the preprocessing is sensitive to plain image against differential attacks. In the encryption process, the after-preprocessing image is partitioned into 32 × 32 pixel image blocks; next they are randomly revolved and encrypted by control sequence and key blocks which are generated by the skew tent map. In postprocessing, the after-encryption image is partitioned into 16 × 16 pixels’ image blocks, and they are randomly revolved and shifted again under control sequences which are related with encrypted image and keys. The postprocessing further increases the diffusion characteristics. Moreover, the test experiment and security analyses are given; the results show that our proposed cryptosystem has both security and speed performance. (shrink)

Considering the highly complex structure of quantum chaos and the nonstationary characteristics of speech signals, this paper proposes a quantum chaotic encryption and quantum particle swarm extraction method based on an underdetermined model. The proposed method first uses quantum chaos to encrypt the speech signal and then uses the local mean decomposition method to construct a virtual receiving array and convert the underdetermined model to a positive definite model. Finally, the signal is extracted using the Levi flight strategy based (...) on kurtosis and the quantum particle swarm optimization optimized by the greedy algorithm. The bit error rate and similarity coefficient of the voice signal are extracted by testing the source voice signal SA1, SA2, and SI943 under different SNR, and the similarity coefficient, uncertainty, and disorder of the observed signal and the source voice signal SA1, SA2, and SI943 verify the effectiveness of the proposed speech signal extraction method and the security of quantum chaos used in speech signal encryption. (shrink)

The study of the chaotic dynamics in fractional-order discrete-time systems has received great attention over the last years. Some efforts have been also devoted to analyze fractional maps with special features. This paper makes a contribution to the topic by introducing a new fractional map that is characterized by both particular dynamic behaviors and specific properties related to the system equilibria. In particular, the conceived one dimensional map is algebraically simpler than all the proposed fractional maps in the literature. Using (...) numerical simulation, we investigate the dynamic and complexity of the fractional map. The results indicate that the new one-dimensional fractional map displays various types of coexisting attractors. The approximate entropy is used to observe the changes in the sequence sequence complexity when the fractional order and system parameter. Finally, the fractional map is applied to the problem of encrypting electrophysiological signals. For the encryption process, random numbers were generated using the values of the fractional map. Some statistical tests are given to show the performance of the encryption. (shrink)

This paper is reporting on electronic implementation of a three-dimensional autonomous system with infinite equilibrium point belonging to a parabola. Performance analysis of an adaptive synchronization via relay coupling and a hybrid steganography chaos encryption application are provided. Besides striking parabolic equilibrium, the proposed three-dimensional autonomous system also exhibits hidden chaotic oscillations as well as hidden chaotic bursting oscillations. Electronic implementation of the hidden chaotic behaviors is done to confirm their physical existence. A good qualitative agreement is shown between (...) numerical simulations and OrCAD-PSpice results. Moreover, adaptive synchronization via relay coupling of three three-dimensional autonomous systems with a parabolic equilibrium is analysed by using time histories. Numerical results demonstrate that global synchronization is achieved between the three units. Finally, chaotic behavior found is exploited to provide a suitable text encryption scheme by hidden secret message inside an image using steganography and chaos encryption. (shrink)

This article introduces a simple and effective new algorithm for image encryption using a chaotic system which is based on the magic squares. This novel 3D chaotic system is invoked to generate a random key to encrypt any color image. A number of chaotic keys equal to the size of the image are generated by this chaotic system and arranged into a matrix then divided into non-overlapped submatrices. The image to be encrypted is also divided into sub-images, and each (...) sub-image is multiplied by a magic matrix to produce another set of matrices. The XOR operation is then used on the resultant two sets of matrices to produce the encrypted image. The strength of the encryption method is tested in two folds. The first fold is the security analysis which includes key space analysis and sensitivity analysis. In the second fold, statistical analysis was performed, which includes the correlation coefficients, information entropy, the histogram, and analysis of differential attacks. Finally, the time of encryption and decryption was computed and show very good results. (shrink)