Kravatte AEAD
We released the specifications of two authenticated encryption schemes built on top of Kravatte, namely Kravatte-SANE and Kravatte-SANSE, replacing Kravatte-SAE and Kravatte-SIV, respectively.
6 weeks ago
Cryptology ePrint Archive: Report 2018/033 - Two-Factor Authentication with End-to-End Password Security
We present a secure two-factor authentication (TFA) scheme based on the possession by the user of a password and a crypto-capable device. Security is ``end-to-end" in the sense that the attacker can attack all parts of the system, including all communication links and any subset of parties (servers, devices, client terminals), can learn users' passwords, and perform active and passive attacks, online and offline. In all cases the scheme provides the highest attainable security bounds given the set of compromised components.
7 weeks ago
Cryptology ePrint Archive: Report 2018/924 - Forward Secure Signatures on Smart Cards
We introduce the forward secure signature scheme XMSS and present an implementation for smart cards. It is based on the hash-based signature scheme XMSS. In contrast to the only previous implementation of a hash-based signature scheme on smart cards by Rohde et al., we solve the problem of on-card key generation. Compared to XMSS, we reduce the key generation time from to , where is the number of signatures that can be created with one key pair. To the best of our knowledge this is the first implementation of a forward secure signature scheme and the first full implementation of a hash-based signature scheme on smart cards. The resulting runtimes are comparable to those of RSA and ECDSA on the same device. This shows the practicality of forward secure signature schemes, even on constrained devices.
xmss  crypto 
10 weeks ago
Cryptology ePrint Archive: Report 2018/912 - Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
Our main result implements a 4-round ZK argument for any language in NP, based on injective one-way functions, that makes black-box use of the underlying function. As a corollary, we also obtain the first 4-round perfect zero-knowledge argument for NP based on claw-free permutations via a black-box construction and 4-round input-delayed commit-and-prove zero-knowledge argument based on injective one-way functions.
crypto  complexity  zkp 
10 weeks ago
An Enciphering Scheme Based on a Card Shuffle
We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alternatively, to directly build a confusion/diffusion blockcipher). We then prove that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security (assuming an ideal round function) to a number of adversarial queries that is nearly the size of the construction’s domain. Swap-or-not provides a direct solution for building a small-domain cipher and achieving format-preserving encryption, yielding the best bounds known for a practical scheme for enciphering credit-card numbers. The analysis of swap-or-not is based on the theory of mixing times of Markov chains.
august 2018
Cryptology ePrint Archive: Report 2007/039
New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures
august 2018
SIDH on ARM: Faster Modular Multiplications for Faster Post-Quantum Supersingular Isogeny Key Exchange
"The techniques for modular multiplication presented in this work
have broad applications to other cryptographic schemes."
montgomery  crypto  ecc  arm 
august 2018
Cryptology ePrint Archive: Report 2016/154
Highly-Efficient Fully-Anonymous Dynamic Group Signatures
july 2018
The Pythia PRF Service
We propose a modern PRF service called PYTHIA designed to offer a level of flexibility, security, and ease- of-deployability lacking in prior approaches. The keystone of PYTHIA is a new cryptographic primitive called a verifiable partially-oblivious PRF that reveals a portion of an input message to the service but hides the rest. We give a construction that additionally supports efficient bulk rotation of previously obtained PRF values to new keys. Performance measurements show that our construction, which relies on bilinear pairings and zero-knowledge proofs, is highly practical. We also give accompanying formal definitions and proofs of security.
june 2018
« earlier      
advice aes agriculture ai algorithm altivec analysis apache api architecture arm art article assembler awesome beer bitcoin blog book books boost botan brewing business c c++ c++11 cache capabilities cell china code coffee compiler compilers computers concurrency conference corruption cpu crypto cuda culture database datastructures dc debugging design dht distributed diy django documentation e ecc ecdsa economics economy education electronics energy environment erlang essay fiction filesystem filter finance firefox food fp framework functional funny games gardening gcc gentoo google government graphics grimmeathookfuture gtd gui hardware hashfunction haskell health history hosting howto humor ibm ietf intel interesting internet interview ipod java javascript json jvm kernel language lattices law learning library lifehacks linux lisp mail management manual maple maps math mceliece memcached memory messaging military money monotone music network networking news nist nyc ocaml opensource operatingsystem optimization organization p2p pairings pake paper papers parallel parser parsing patterns paulgraham paxos people performance perl philosophy photo photography physics pir policestate politics powerpc pqcrypto prion privacy productivity programming protocol psychology python reference reviews rfc rng rsa ruby running rust scala scheme science scifi search security serialization server sgx shopping sidechannel simd singularity society software spam sql ssl standard statistics stm storage surveillance sysadmin systems tahoe technology testing theory threads tls tool toolbox tools toreview tpm travel tutorial unix usa verification vermont versioncontrol video visualization web web2.0 windows work writing x11 x509 x86

Copy this bookmark: