Cryptology ePrint Archive: Report 2017/240
Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
11 weeks ago
[1702.07588] Practical Homomorphic Encryption Over the Integers
We present novel homomorphic encryption schemes for integer arithmetic, intended for use in secure single-party computation in the cloud. These schemes are capable of securely computing only low degree polynomials homomorphically, but this appears sufficient for most practical applications. In this setting, our schemes lead to practical key and ciphertext sizes. We present a sequence of generalisations of our basic schemes, with increasing levels of security, but decreasing practicality. We have evaluated the first four of these algorithms by computing a low-degree inner product. The timings of these computations are extremely favourable. Finally, we use our ideas to derive a fully homomorphic system, which appears impractical, but can homomorphically evaluate arbitrary Boolean circuits.
february 2017
Cryptology ePrint Archive: Report 2017/141
In this paper we seek for a more flexible, yet secure, GPAKE and put forward the notion of partitioned GPAKE. Partitioned GPAKE tolerates users that run the protocol on different passwords. Through a protocol run, any subgroup of users that indeed share a password, establish a session key, factoring out the ``noise'' of inputs by users holding different passwords.
pake  crypto 
february 2017
Large-scale cluster management at Google with Borg
Google's Borg system is a cluster manager that runs hundreds of thousands of jobs, from many thousands of different applications, across a number of clusters each with up to tens of thousands of machines
google  distributed 
february 2017
Computational Complexity and the Anthropic Principle
"Namely, if suicide really were a solution to life's problems, then one could exploit that fact to solve NP-complete problems in polynomial time! I'm thinking of starting a suicide hotline for computer scientists, where I'll explain this point to them."
february 2017
Exclusive Exponent Blinding May Not Suffice to Prevent Timing Attacks on RSA
tl;dr If extra subtract in Montgomery reduction is measurable, side channel attack can be mounted even with exponent blinding.
crypto  rsa 
january 2017
ANVIL: Software-Based Protection Against Next-Generation Rowhammer Attacks
Including a clflush-free rowhammer attack exploiting the L3 cache logic to force DRAM access with plain loads + stores.
rowhammer  security  pdf 
november 2016
Comparison of the 5/16 and 7/16 spouts for tapping maple
UVM extension study - only small reduction in production switching to smaller taps
sugaring  uvm 
october 2016
Abstract: CRIME and BREACH attacks on TLS/SSL leverage the fact that compression ratio is not hidden by encryption to recover content of secrets. We introduce SafeDeflate---a modification of a standard Deflate algorithm which compression ratio does not leak information about secret tokens. The modification is compatible with existing Deflate and gzip decompressors. We introduce a model in which attacker can obtain ciphertexts of arbitrary compressed plaintext containing secret values. Then we prove that SafeDeflate is secure in this model.
compression  crypto 
october 2016
« earlier      
actors advice aes agriculture ai algorithm altivec analysis apache api apple architecture arm art article asio asn.1 assembler awesome beer bitcoin blog book books boost botan brewing business c c# c++ c++11 cache capabilities cell china clang clojure cluster code coffee comic compiler compilers computers concurrency conference corruption cpu crypto cs cuda culture database datastructures dc debugging design dht distributed diy django documentation e ecc economics economy education electronics energy environment erlang essay farm farming fiction filesystem filter finance firefox food fp framework functional funny games gardening gcc gentoo git google government graphics grimmeathookfuture gtd gui hardware hashfunction haskell health history hosting housing howto humor ibm ietf intel interesting internet interview investing ipod java javascript json jvm kernel language law learning library life lifehacks linux lisp logic mail management manual map maple maps math mceliece medicine memcached memory messaging microsoft military money monotone multicore music network networking news nist nsa nyc ocaml oil opensource operatingsystem optimization organization p2p paper papers parallel parser parsing patterns paulgraham paxos peakoil people performance perl philosophy photo photography physics pki policestate politics postfix powerpc pqcrypto prion privacy productivity programming protocol psychology python radio recipe reference reviews rfc rng rsa ruby running scala scheme science scifi search security serialization server sgx shopping sidechannel simd singularity society software space spam specification sql ssl standard statistics stm storage surveillance sysadmin systems tahoe tcp technology terrorism testing theory threads tls tool toolbox tools toreview tpm travel tutorial unix usa verification vermont versioncontrol via:cryptogon video visualization web web2.0 webserver windows work writing x11 x509 x86

Copy this bookmark: