Public-key cryptography in functional programming context
Gyongyver Marton2010, arXiv (Cornell University)
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
Cryptography is the science of information and communication security. Up to now, for efficiency reasons cryptographic algorithm has been written in an imperative language. But to get acquaintance with a functional programming language a question arises: functional programming offers some new for secure communication or not? This article investigates this question giving an overview on some cryptography algorithms and presents how the RSA encryption in the functional language Clean can be implemented and how can be measured the efficiency of a certain application.
Related papers
A Review Article on Cryptography Using Functional Programming:Haskell
2021
A modern wave of programming technology has been at the frontline of functional languages, experiencing growing success as well as impact. Hughes published an article entitled 'Why Functional Programming Matters', that has now been one of the most recent references in the field.Safe programming defines the method used by software engineers to include multiple safety mechanism for their system.Secure programming can be broken down into two subgroups to analyse its correlation with software design: access control, secure programme initialization, input validation, cryptography, secure networking, secure random number generation, and anti-tampering. In this paper we provide a review of various functional programming in Haskell for encryption. The inkling of functional programming is to make programming more closely related to mathematics. We describe crucial features and trade-offs that has to be well-thought-out while selecting the right method for secure computation.
Verifiable Functional Encryption
Advances in Cryptology – ASIACRYPT 2016, 2016
In light of security challenges that have emerged in a world with complex networks and cloud computing, the notion of functional encryption has recently emerged. In this work, we show that in several applications of functional encryption (even those cited in the earliest works on functional encryption), the formal notion of functional encryption is actually not sufficient to guarantee security. This is essentially because the case of a malicious authority and/or encryptor is not considered. To address this concern, we put forth the concept of verifiable functional encryption, which captures the basic requirement of output correctness: even if the ciphertext is maliciously generated (and even if the setup and key generation is malicious), the decryptor is still guaranteed a meaningful notion of correctness which we show is crucial in several applications. We formalize the notion of verifiable function encryption and, following prior work in the area, put forth a simulation-based and an indistinguishability-based notion of security. We show that simulationbased verifiable functional encryption is unconditionally impossible even in the most basic setting where there may only be a single key and a single ciphertext. We then give general positive results for the indistinguishability setting: a general compiler from any functional encryption scheme into a verifiable functional encryption scheme with the only additional assumption being the Decision Linear Assumption over Bilinear Groups (DLIN). We also give a generic compiler in the secret-key setting for functional encryption which maintains both message privacy and function privacy. Our positive results are general and also apply to other simpler settings such as Identity-Based Encryption, Attribute-Based Encryption and Predicate Encryption. We also give an application of verifiable functional encryption to the recently introduced primitive A.
Functional Programming and Security
2012
This paper analyses the security contribution of typical functional-language features by examining them in the light of accepted information security principles. Imperative and functional code are compared to illustrate various cases. In conclusion, there may be an excellent case for the use of functional languages on the grounds of better security; however, empirical research should be done to validate this possibility.
A survey on Functional Encryption
2021
Functional Encryption (FE) expands traditional public-key encryption in two di erent ways: it supports fine-grained access control and it allows to learn a function of the encrypted data. In this paper, we review all FE classes, describing their functionalities and main characteristics. In particular, for each class we mention several schemes, providing their security assumptions and comparing their properties. To our knowledge, this is the first survey that encompasses the entire FE family.
Avoiding Security Pitfalls with Functional Programming: A Report on the Development of a Secure XML Validator
2015 IEEE/ACM 37th IEEE International Conference on Software Engineering, 2015
Public-Key Cryptography Theory and Practice
Viele haben auf die eine oder andere Weise dazu beigetragen, dass diese Dissertation so entstehen konnte, wie sie nun vorliegt. Der Versuch einer vollständigen Aufzählung müsste scheitern; hier seien zunächst die erwähnt, die nicht mit Namen genannt werden können, weil sie als anonyme Gutachter für Konferenzen tätig waren und dabei Anregungen zur Darstellung einiger der hier präsentierten Ergebnisse beigetragen haben. Außerdem zu nennen ist David Hopwood, der in einer früheren Fassung der Ausführungen zur beweisbaren Sicherheit des Mix-Verfahrens (hier in Abschnitt 4.2) eine Lücke aufgespürt hat. Prof. Johannes Buchmann hat es auf bemerkenswerte Weise verstanden, die Arbeitsbedingungen zu schaffen, in denen diese Dissertation gedeihen konnte, und hat wertvolle Anregungen geliefert. Auch alle anderen am Fachgebiet Theoretische Informatik hatten teil daran, eine angenehme und fruchtbare Arbeitsatmosphäre zu schaffen. Danke!
Public Key Cryptography and the RSA Cryptosystem
2009
the right level, some of the proofs could be optional. The software used in this module is Maple 12, though it should also work with some of the earlier versions of Maple. There are several projects to choose from at the end. Given the nature of the subject some of these projects are research oriented and not completely prescribed. Others are of hands-on type and also not completely prescribed, some of the details need to be determined by the instructor. The exercises inserted throughout the module and the projects at the end can be used as an assessment tool.
Mix and Match: Secure Function Evaluation via Ciphertexts
Lecture Notes in Computer Science, 2000
We introduce a novel approach to general secure multiparty computation that avoids the intensive use of verifiable secret sharing characterizing nearly all previous protocols in the literature. Instead, our scheme involves manipulation of ciphertexts for which the underlying private key is shared by participants in the computation. The benefits of this protocol include a high degree of conceptual and structural simplicity, low message complexity, and substantial flexibility with respect to input and output value formats. We refer to this new approach as mix and match. While the atomic operations in mix and match are logical operations, rather than full field operations as in previous approaches, the techniques we introduce are nonetheless highly practical for computations involving intensive bitwise manipulation. One application for which mix and match is particularly well suited is that of sealed-bid auctions. Thus, as another contribution in this paper, we present a practical, mix-and-match-based auction protocol that is fully private and non-interactive and may be readily adapted to a wide range of auction strategies.
A modification of the RSA public-key encryption procedure (Corresp
IEEE Transactions on Information Theory, 1980
Rivest, Shamir, and Adfeman (RSA) public-key encryp-tionalgorithmcanbebrdreniftheintegerRusedssthemoduluscanbe factored. It may however be possible to brew& this system witbuut factoring R. A modification of the. RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a awtain number of operatfons, then R can be factored in only a few more operations. Fwthermorq this technique can also be used to produce digital signa~inmucbtbesamecmanne rastheRSAs&eme.
Related papers
Controlled Functional Encryption
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014
Motivated by privacy and usability requirements in various scenarios where existing cryptographic tools (like secure multi-party computation and functional encryption) are not adequate, we introduce a new cryptographic tool called Controlled Functional Encryption (C-FE). As in functional encryption, C-FE allows a user (client) to learn only certain functions of encrypted data, using keys obtained from an authority. However, we allow (and require) the client to send a fresh key request to the authority every time it wants to evaluate a function on a ciphertext. We obtain efficient solutions by carefully combining CCA2 secure public-key encryption (or rerandomizable RCCA secure public-key encryption, depending on the nature of security desired) with Yao's garbled circuit. Our main contributions in this work include developing and formally defining the notion of C-FE; designing theoretical and practical constructions of C-FE schemes achieving these definitions for specific and general classes of functions; and evaluating the performance of our constructions on various application scenarios.
Revisiting Secure Computation Using Functional Encryption: Opportunities and Research Directions
2020 Second IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA), 2020
Increasing incidents of security compromises and privacy leakage have raised serious privacy concerns related to cyberspace. Such privacy concerns have been instrumental in the creation of several regulations and acts to restrict the availability and use of privacy-sensitive data. The secure computation problem, initially and formally introduced as secure two-party computation by Andrew Yao in 1986, has been the focus of intense research in academia because of its fundamental role in building many of the existing privacy-preserving approaches. Most of the existing secure computation solutions rely on garbled-circuits and homomorphic encryption techniques to tackle secure computation issues, including efficiency and security guarantees. However, it is still challenging to adopt these secure computation approaches in emerging compute-intensive and data-intensive applications such as emerging machine learning solutions. Recently proposed functional encryption scheme has shown its promise as an underlying secure computation foundation in recent privacy-preserving machine learning approaches proposed. This paper revisits the secure computation problem using emerging and promising functional encryption techniques and presents a comprehensive study. We first briefly summarize existing conventional secure computation approaches built on garbled-circuits, oblivious transfer, and homomorphic encryption techniques. Then, we elaborate on the unique characteristics and challenges of emerging functional encryption based secure computation approaches and outline several research directions.
Semantically Secure Functional Encryption, Revisited
Abstract. Functional encryption (FE) is a powerful cryptographic primitive that generalizes many asymmetric encryption systems proposed in recent years. Syntax and security definitions for general FE were recently proposed by Boneh, Sahai, and Waters (BSW)(TCC 2011) and independently by O'Neill (ePrint 2010/556). In this paper we revisit these definitions, identify a number of shortcomings in them, and propose a new definitional approach that overcomes these limitations.
Programming Techniques and Data Structures Digital Signatures with RSA and Other Public.Key Cryptosystems
Public-key signature systems can be vulnerable to attack if the protocols for signing messages allow a cryptanalyst to obtain signatures on arbitrary messages of the cryptanalyst's choice. This vulnerability is shown to arise from the homomorphic structure of public-key systems. A method of foiling the attack is described.
Functional Encryption for Randomized Functionalities
Theory of Cryptography, 2015
In this work, we present the first definitions and constructions for functional encryption supporting randomized functionalities. The setting of randomized functionalities require us to revisit functional encryption definitions by, for the first time, explicitly adding security requirements for dishonest encryptors, to ensure that they cannot improperly tamper with the randomness that will be used for computing outputs. Our constructions are built using indistinguishability obfuscation.
Joint Operation in Public Key Cryptography
International Journal of Advanced Computer Science and Applications, 2013
We believe that there is no real data protection without our own tools. Therefore, our permanent aim is to have more of our own codes. In order to achieve that, it is necessary that a lot of young researchers become interested in cryptography. We believe that the encoding of cryptographic algorithms is an important step in that direction, and it is the main reason why in this paper we present a software implementation of finding the inverse element, the operation which is essentially related to both ECC (Elliptic Curve Cryptography) and the RSA schemes of digital signature.
Public-Key Cryptography (Dagstuhl Seminar 11391)}}
From September 25th till September 30th, 2011, the Dagstuhl Seminar 11391 about "Public-Key Cryptography" took place at Schloss Dagstuhl. The meeting hosted 33 international researchers and incited active discussions about recent developments in this area. Seminar 25.-30. September, 2011 -www.dagstuhl.de/11391 1998 ACM Subject Classification D.4.6 Security and Protection
A Study of Cryptographic Algorithms
International Journal for Research in Applied Science & Engineering Technology (IJRASET), 2022
This paper explores many important Symmetric and Asymmetric Cryptography algorithms and their essence in network security. As the use of the internet has grown, so have attacks on the communication channels. These attacks can be used by third parties to obtain sensitive data about your organization and its activities. This data can be used to compromise an organization's operations or blackmail the organisation to pay for the data. To avoid these situations, such algorithms are adapted to protect communications. These algorithms encrypt data that is nearly impossible for unauthorized persons to read, making it unusable for attackers. These algorithms therefore play an important role in the security of communications. This paper states a study of symmetric and asymmetric algorithms in terms of optimal resource allocation, potential attacks which can be used to exploit these algorithms, time consumption, power consumption, overall structure and some other basis Along with explanation of some of the security attacks.
RSA ALGORITHM: A THEORETICAL STUDY AND IMPLEMENTATION
IRJMETS, 2020
There are many aspects in which security can be provided, even many applications too like secure payments, private communications. One such indispensable aspect is Cryptography. Though it's probably the oldest art, still the techniques used in Cryptography are a crucial means in achieving security. It not only clinches in making information restricted but also delivers various protection and security features like system security, digital signatures. So, the methods, encryption, and decryption of cryptography play a vital role in achieving the security mentioned above. The quality of the security provided will be entirely dependent on the quality of the encryption and decryption algorithms which in turn can be said to be based on the structure of mathematics and the confidentiality of key. The key can be said as the essence of encryption, as by knowing the key a person can encrypt or decrypt the information. Hence, choosing the key is the most vital process. This paper provides an overview and implementation of RSA, a public-key cryptosystem.
Critical Analysis of Various Cryptographic Algorithms
Journal of Ultra Computer and information Technology, 2017
Now a day mostly people are doing their daily routine digitally, because current era is based on information and communication technology. But security is one of the most important and challenging issues in this technological world. As per the literature analysis there is a demand for a encryption which should be strong and efficient. Cryptography is a private secure communication in the public world. Cryptography is a technique of protecting secure information from hacking and cracking by unauthorized individuals and converting it into unintelligible form. It provides authentication, identification to user data, confidentiality and also provides security and privacy to the data stored. It is an emerging technology in the area of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures communication. The main objective of this paper is to study the basic terms used in cryptography, its purpose and to compare the encryption techniques used in cryptography.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.