1,534 research outputs found
A Review on Biological Inspired Computation in Cryptology
Cryptology is a field that concerned with cryptography and cryptanalysis. Cryptography, which is a key technology in providing a secure transmission of information, is a study of designing strong cryptographic algorithms, while cryptanalysis is a study of breaking the cipher. Recently biological approaches provide inspiration in solving problems from various fields. This paper reviews major works in the application of biological inspired computational (BIC) paradigm in cryptology. The paper focuses on three BIC approaches, namely, genetic algorithm (GA), artificial neural network (ANN) and artificial immune system (AIS). The findings show that the research on applications of biological approaches in cryptology is minimal as compared to other fields. To date only ANN and GA have been used in cryptanalysis and design of cryptographic primitives and protocols. Based on similarities that AIS has with ANN and GA, this paper provides insights for potential application of AIS in cryptology for further research
Using and producing ideas in computable endogenous growth
It is shown that Paul Romer’s suggestion to model algorithmically the use and production of ideas in an endogenous growth model is formally feasible. Such a modelling exercise imparts a natural evolutionary flavour to growth models. However, it is also shown that the policy implications are formally indeterminate in a precise and effective sense.endogenous growth,algorithmic ideas,computable growth
Tutorials at PPSN 2016
PPSN 2016 hosts a total number of 16 tutorials covering a broad range of current research in evolutionary computation. The tutorials range from introductory to advanced and specialized but can all be attended without prior requirements. All PPSN attendees are cordially invited to take this opportunity to learn about ongoing research activities in our field
Zero-Knowledge Proof-of-Identity: Sybil-Resistant, Anonymous Authentication on Permissionless Blockchains and Incentive Compatible, Strictly Dominant Cryptocurrencies
Zero-Knowledge Proof-of-Identity from trusted public certificates (e.g.,
national identity cards and/or ePassports; eSIM) is introduced here to
permissionless blockchains in order to remove the inefficiencies of
Sybil-resistant mechanisms such as Proof-of-Work (i.e., high energy and
environmental costs) and Proof-of-Stake (i.e., capital hoarding and lower
transaction volume). The proposed solution effectively limits the number of
mining nodes a single individual would be able to run while keeping membership
open to everyone, circumventing the impossibility of full decentralization and
the blockchain scalability trilemma when instantiated on a blockchain with a
consensus protocol based on the cryptographic random selection of nodes.
Resistance to collusion is also considered.
Solving one of the most pressing problems in blockchains, a zk-PoI
cryptocurrency is proved to have the following advantageous properties:
- an incentive-compatible protocol for the issuing of cryptocurrency rewards
based on a unique Nash equilibrium
- strict domination of mining over all other PoW/PoS cryptocurrencies, thus
the zk-PoI cryptocurrency becoming the preferred choice by miners is proved to
be a Nash equilibrium and the Evolutionarily Stable Strategy
- PoW/PoS cryptocurrencies are condemned to pay the Price of Crypto-Anarchy,
redeemed by the optimal efficiency of zk-PoI as it implements the social
optimum
- the circulation of a zk-PoI cryptocurrency Pareto dominates other PoW/PoS
cryptocurrencies
- the network effects arising from the social networks inherent to national
identity cards and ePassports dominate PoW/PoS cryptocurrencies
- the lower costs of its infrastructure imply the existence of a unique
equilibrium where it dominates other forms of paymentComment: 2.1: Proof-of-Personhood Considered Harmful (and Illegal); 4.1.5:
Absence of Active Authentication; 4.2.6: Absence of Active Authentication;
4.2.7: Removing Single-Points of Failure; 4.3.2: Combining with
Non-Zero-Knowledge Authentication; 4.4: Circumventing the Impossibility of
Full Decentralizatio
Regular and almost universal hashing: an efficient implementation
Random hashing can provide guarantees regarding the performance of data
structures such as hash tables---even in an adversarial setting. Many existing
families of hash functions are universal: given two data objects, the
probability that they have the same hash value is low given that we pick hash
functions at random. However, universality fails to ensure that all hash
functions are well behaved. We further require regularity: when picking data
objects at random they should have a low probability of having the same hash
value, for any fixed hash function. We present the efficient implementation of
a family of non-cryptographic hash functions (PM+) offering good running times,
good memory usage as well as distinguishing theoretical guarantees: almost
universality and component-wise regularity. On a variety of platforms, our
implementations are comparable to the state of the art in performance. On
recent Intel processors, PM+ achieves a speed of 4.7 bytes per cycle for 32-bit
outputs and 3.3 bytes per cycle for 64-bit outputs. We review vectorization
through SIMD instructions (e.g., AVX2) and optimizations for superscalar
execution.Comment: accepted for publication in Software: Practice and Experience in
September 201
- …