eljko Vrba, Pål Halvorsen, Carsten Griwodz · 2010
Program obfuscation is often employed by malware in order to avoid detection by anti-virus software, but it has many other legitimate uses, such as copy protection, software licensing or private computing in the cloud. In this paper, we present a program obfuscation method that is based on the combination of strong encryption of code and data and a CPU simulator(CSPIM) that implements the MIPS I instruction set. Our method is different from existing methods in that only a single word (32-bits) of the protected code or data is present as plain-text in main memory. Furthermore, our method allows the possibility of externally supplying the decryption key to the simulator. We have extensively tested the simulator, and it is able to successfully execute C programs compiled by the gcc cross-compiler. Even though purely software-based method cannot provide perfect protection, we argue that this approach significantly raises the bar for reverse-engineers, especially when combined with existing program obfucation techniques.
Cited by 13
Konečný, Jakub · Brno University of Technology Digital Library (Brno University of Technology) · 2017
Práce je zaměřena na kryptografii na čipových kartách. Popisuje čipové karty, jak z hardwarového, tak softwarového hlediska. Srovnává známé operační systémy používané na čipových kartách. Vybrané systémy podrobněji zkoumá. Dále jsou v práci představeny vybrané protokoly pro autentizované ustanovení klíče. Protokol PACE je podrobněji představen a je navrhnuta jeho implementace. Následně je implementován na čipových kartách Basic card. Implementace je blíže analyzována a v závěru jsou navržena možná vylepšení.
Cited by 0
Cooke, Stephanie Donovan, Gerrit Huizenga Ibm et al. · 2003
In 2.5, strong cryptography has been incorporated into the kernel. This inclusion was a result of several motivating factors: remove duplicated code, harmonize IPv6/IPSec, and the usual crypto-paranoia. The authors will present the history of the Cryptographic API, its current state, what kernel facilities are currently using it, which ones should be using it, plus the new future applications including: 1. Hardware and assembly crypto drivers 2. Kernel module code-signing 3. Hardware random number generation 4. Filesystem encryption, including swap space.
Cited by 0
Narayanan, Anand Kumar · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2025
Sampling a non degenerate (that is, invertible) square matrix over a finite field is easy, draw a random square matrix and discard if the determinant is zero. We address the problem in higher dimensions, and sample non degenerate boundary format tensors, which generalise square matrices. Testing degeneracy is conjectured to be hard in more than two dimensions [Hillar and Lim, 2013], precluding the "draw a random tensor and discard if degenerate" recipe. The difficulty is in computing hyperdeterminants, higher dimensional analogues of determinants. Instead, we start with a structured random non degenerate tensor and scramble it by infusing more randomness while still preserving non degeneracy. We propose two kinds of scrambling. The first is multiplication in each dimension by random invertible matrices, which preserves dimension and format. Assuming pseudo randomness of this action, which also underlies tensor isomorphism based cryptography, our samples are computationally indistinguishable from uniform non degenerate tensors. The second scrambling employs tensor convolution (that generalises multiplication by matrices) and can increase dimension. Inspired by hyperdeterminant multiplicativity, we devise a recursive sampler that uses tensor convolution to reduce the problem from arbitrary to three dimensions. Our sampling is a candidate solution for drawing public keys in tensor isomorphism based cryptography, since non degenerate tensors elude recent weak key attacks targeting public key tensors either containing geometric structures such as "triangles" [Lars Ran and Simona Samardjiska, 2024] or being deficient in tensor rank [Gilchrist et al., 2024]. To accommodate our sampling, tensor isomorphism based schemes need to be instantiated in boundary formats such as (2k+1) × (k+1) × (k+1), away from the more familiar k × k × k cubic formats. Our sampling (along with the recent tensor trapdoor one-way functions [Anand Kumar Narayanan, 2025]) makes an enticing case to transition tensor isomorphism cryptography to boundary formats tensors, which are true analogues of square matrices.
Cited by 0Open access
Horace P. Yuen · NASA Technical Reports Server (NASA)
Several quantum cryptosystems utilizing different kinds of nonclassical lights, which can accommodate high intensity fields and high data rate, are described. However, they are all sensitive to loss and both the high rate and the strong-signal character rapidly disappear. A squeezed light homodyne detection scheme is proposed which, with present-day technology, leads to more than two orders of magnitude data rate improvement over other current experimental systems for moderate loss.
Cited by 2Open access
Arnold G. Reinhold · Issue Lab (Candid) · 1999
Encryption technology allows people using electronic networks to ensure that the messages they send remain private--secure from hackers, industrial espionage, government wiretap abuses, and spies. Encryption technology will prove vital to the future of electronic commerce. For example, thefts of nuclear secrets from U.S. national laboratories would be much less likely if the labs' commercial software had built-in encryption features that could be used to limit unauthorized access--a type of security product discouraged by export controls. For years the U.S. government has struggled unsuccessfully to control the export of encryption technology from this country. Those ineffectual controls do, however, adversely affect the competitive position of the U.S. software industry and national security. Despite the controls, powerful encryption products are increasingly available around the world. Those products include Pretty Good Privacy, which offers 128-bit encryption, and many others. This paper provides a list of Web sites where such products may be found, thus establishing beyond doubt the futility of controls. Although some of the Web sites may from time to time disappear, others will spring up in their place.
Cited by 0
Jamie Sikora, André Chailloux, Iordanis Kerenidis · Physical Review A · 2014
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an in-depth analysis of a simple question: What happens when we perform two measurements sequentially on the same quantum system? This question touches upon some fundamental properties of quantum mechanics, namely the uncertainty principle and the complementarity of quantum measurements. Our results have interesting consequences, for example, they can provide a simple proof of the optimal quantum strategy in the famous Clauser-Horne-Shimony-Holt game. Moreover, we show that the way information is encoded in quantum systems can provide a different perspective in understanding other fundamental aspects of quantum information, like nonlocality and quantum cryptography. We prove some strong equivalences between these notions and provide a number of applications in all areas.
Cited by 13Open access
Standaert, François-Xavier · DIAL (Catholic University of Leuven) · 2023
Cited by 0Open access
Mike Cheng, Ludovic Vaillant, Mike Savage et al. · 2025
Encrypt R objects to a raw vector or file using modern cryptographic techniques. Password-based key derivation is with 'Argon2' (<<a href="https://en.wikipedia.org/wiki/Argon2" target="_top">https://en.wikipedia.org/wiki/Argon2</a>>). Objects are serialized and then encrypted using 'XChaCha20-Poly1305' (<<a href="https://en.wikipedia.org/wiki/ChaCha20-Poly1305" target="_top">https://en.wikipedia.org/wiki/ChaCha20-Poly1305</a>>) which follows RFC 8439 for authenticated encryption (<<a href="https://en.wikipedia.org/wiki/Authenticated_encryption" target="_top">https://en.wikipedia.org/wiki/Authenticated_encryption</a>>). Cryptographic functions are provided by the included 'monocypher' 'C' library (<<a href="https://monocypher.org" target="_top">https://monocypher.org</a>>).
Cited by 0Open access
André Chailloux, Kerenidis, Iordanis, Sikora, Jamie · HAL (Le Centre pour la Communication Scientifique Directe) · 2013
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an in-depth analysis of a simple question: What happens when we perform two measurements sequentially on the same quantum system? This question touches upon some fundamental properties of quantum mechanics, namely the uncertainty principle and the complementarity of quantum measurements. Our results have interesting consequences, for example they can provide a simple proof of the optimal quantum strategy in the famous Clauser-Horne-Shimony-Holt game. Moreover, we show that the way information is encoded in quantum systems can provide a different perspective in understanding other fundamental aspects of quantum information, like non-locality and quantum cryptography. We prove some strong equivalences between these notions and provide a number of applications in all areas.
Cited by 0Open access
Bibhash Roy, Gautam Rakshit, Pratim Singha et al. · 2011
Cryptography is one of the major concerned areas of computer and data security and a very promising direction in cryptography research is known as DNA Cryptography. DNA computational logic can be used in cryptography for encrypting, storing and transmitting the information, as well as for computation. Although in its primitive stage, DNA cryptography is shown to be very effective. In this paper, a proposal is given where the concept of DNA is being used in the encryption and decryption process. The theoretical analysis and implementations shows this method to be efficient in computation, storage and transmission; and it is very powerful against certain attacks. This paper also proposes a unique cipher text generation procedure as well as a new key generation procedure. Finally, to demonstrate the performance of the proposed method, its implementation is explained and the results are analyzed.
Cited by 42
Jamie Sikora, André Chailloux, Iordanis Kerenidis · HAL (Le Centre pour la Communication Scientifique Directe) · 2014
International audience
Cited by 0Open access
Ajay B. Gadicha, Vijay B. Gadicha · Journal of Cybersecurity and Information Management · 2020
In this era of digitization where literally everything is available at the tip of the finger. Huge amount of data used to flow day in day out, where users used to work with various applications like internet websites, cloud applications, various data servers, web servers, etc. This paper provide idea about access control or authentication used to be acting as first line of defense for preserving data secrecy and its integrity, so far it is learned that the usual login password based methods are easy to implement and to use as well but it is also observed that they are more subjected to be get attacked therefore to preserve authentication on the basis of simple alphanumeric passwords is a challenging task now a days. Hence new methods which bring more strength for authentication and access control are so very expected and desirable.
Cited by 13
Mouanda, Joachim Moussounda · 2023
Cited by 0Open access
Abdullah Alsulami, Darren Teo, Weiyi He et al. · American Research Journal of Computer Science and Information Technology · 2016
Combining iris biometric system and cryptography will provide a strong security authentication and high performance. Iris-based cryptosystem appears to be the strongest way to generate a key and authenticate users among other biometric recognition such as voice and fingerprint that because the randomness, uniqueness, and stability of Iris. Iris biometric cryptography is a technique used to secure communication and encrypt data between parties using biometric features to provide a False Accept Ratio (FAR) and a False Reject Ratio (FRR).
Cited by 2Open access
Filiol, Eric · HAL (Le Centre pour la Communication Scientifique Directe) · 2004
Imagining what the nature of future viral attacks might look like is the key to successfully protecting against them. This paper discusses how cryptography and key management techniques may definitively checkmate antiviral analysis and mechanisms. We present a generic virus, denoted bradley which protects its code with a very secure, ultra-fast symmetric encryption. Since the main drawback of using encryption in that case lies on the existence of the secret key or information about it within the viral code, we show how to bypass this limitation by using suitable key management techniques. Finally, we show that the complexity of the bradley code analysis is at least as high as that of the cryptanalysis of its underlying encryption algorithm.
Cited by 5Open access
Everts, M., Hoepman, J.-H., Siljee, J. · Radboud Repository (Radboud University) · 2013
\n Contains fulltext :\n 120036.pdf (Publisher’s version ) (Open Access)\n
Cited by 0Open access
Arthur B. Cooper, Jeff Hall, David Mundhenk et al. · Apress eBooks · 2023
Section 4 of the PCI DSS is all about securing sensitive authentication data (SAD) and cardholder data (CHD) when they are transmitted over public networks such as the Internet. However, the concepts presented here also apply to internal networks that are supposed to be not in scope for PCI compliance.
Cited by 0
Short Paper, Maarten H. Everts, Jaap-henk Hoepman et al. · 2013
Passwords are the only ubiquitous form of authentication currently available on the web. Unfortunately, passwords are insecure. In this paper we therefore propose the use of strong cryptography, using the fact that users increasingly own a smartphone that can perform the required cryptographic operations on their behalf. This is not as trivial as it sounds. Services will not migrate to new forms of authentication if few users have the means to use it. Similarly, users will not acquire the means if there are few services that accept them. Moreover, enabling one’s smartphone to seamlessly sign in at a website when browsing on an arbitrary PC is non-trivial. We propose a system, based on a smartphone app, that can be used to sign in with username and password to arbitrary websites using an arbitrary PC or laptop. We describe the protocol and implementation to achieve this without the need for typing usernames and passwords. Furthermore, we propose an authentication protocol based on public key cryptography, integrated in the same smartphone app. This allows websites to seamlessly migrate towards a much more secure authentication method on the web, independently of each other. A prototype of our system has been developed.
Cited by 0
Rui Ma, Linyue Du · PLoS ONE · 2024
In an attribute-based strong designated verifier signature, a signer who satisfies the access structure signs the message and assigns it to a verifier who satisfies the access structure to verify it, which enables fine-grained access control for signers and verifiers. Such signatures are used in scenarios where the identity of the signer needs to be protected, or where the public verifiability of the signature is avoided and only the designated recipient can verify the validity of the signature. To address the problem that the overall overhead of the traditional attribute-based strong designated verifier signature scheme is relatively large, an efficient attribute-based strong designated verifier signature scheme based on elliptic curve cryptography is proposed, as well as a security analysis of the new scheme given in the standard model under the difficulty of the elliptic curve discrete logarithm problem (ECDLP). On the one hand, the proposed scheme is based on elliptic curve cryptography and uses scalar multiplication on elliptic curves, which is computationally lighter, instead of bilinear pairing, which has a higher computational overhead in traditional attribute-based signature schemes. This reduces the computational overhead of signing and verification in the system, improves the efficiency of the system, and makes the scheme more suitable for resource-constrained cloud end-user scenarios. On the other hand, the proposed scheme uses LSSS (Linear Secret Sharing Schemes) access structure with stronger access policy expression, which is more efficient than the "And" gate or access tree access structure, making the computational efficiency of the proposed scheme meet the needs of resource-constrained cloud end-users.
Cited by 3Open access