Papers We Love is a user on mstdn.io. You can follow them or interact with them if you have an account anywhere in the fediverse. If you don't, you can sign up here.

Papers We Love @paperswelove@mstdn.io

Papers We Love Conf 2018 is happening again this year in St. Louis with Strangeloop! We're a non-profit organization and rely on sponsorships to fund the conference. If you or your company are interested in sponsoring check out our prospectus buff.ly/2Ir4E8E

No compromises: distributed transactions with consistency, availability, and performance - Dragojevic, et al. buff.ly/2KBEDBx

We show that adistributed platform called FaRM can provide dist. transactions with serializability, high perf, durability, and high availability.

VIDEO: Bonnie Eisenman (@brindelle) on Multiphase Numerical Modeling... for Jigsaw Puzzle Generation - buff.ly/2IE5q2h

This paper explores expansions on the stylistic variety of handmade and artisanal jigsaw puzzles through techniques from natural simulation. pic.twitter.com/prhW8YyHAV

If you're not familiar with Papers We Love Conf, check out the speakers and videos from our past years:

2017: t.co/K1No8nWEnE
2016: t.co/n1xdmggSp2

SCHEME: An Interpreter for Extended Lambda Calculus - Sussman, Steele buff.ly/2KnJVRj

Design of LISP-Based Processors or, SCHEME: A Dialectric LISP or, Finite Memories Considered Harmful or, LAMBDA: The Ultimate Opcode - Steele, Sussman buff.ly/2Fse5z7

The Art of the Interpreter or, The Modularity Complex (Parts Zero, One and Two) - Steele, Sussman buff.ly/2KlIJO2

Debunking the "Expensive Procedure Call" Myth or, Procedure Call Implementations Considered Harmful or, LAMBDA: The Ultimate Goto - Steele, buff.ly/2KpsKP2

Papers We Love Conf will be back in St. Louis this year as part of the Pre-Conference Activities!

thestrangeloop.com/preconf.html

Anna: A KVS For Any Scale - Wu, Faleiro, Lin, Hellerstein buff.ly/2HlTaPC

Our design rests on a simple architecture of coordination-free actors that perform state update via merge of lattice-based composite data structures.

Darts, Dice, and Coins: Sampling from a Discrete Distribution - Schwarz buff.ly/s5PmtU

"You are given an n-sided die where side i has probability pi of being rolled. What is the most efficient data structure for simulating rolls of the die?"

t.co/oy50ddTjfb

Synode: Understanding and Automatically Preventing Injection Attacks on Node.js - Staicu, et al. buff.ly/2Hq3CFA

We show that injection vulnerabilities are prevalent in practice, both due to eval and the powerful exec API introduced in Node.js.

Measuring and Disrupting Anti-Adblockers Using Differential Execution Analysis - Zhu buff.ly/2FBj7tZ

We want to develop a comprehensive understanding of anti-adblockers, with the ultimate aim of enabling adblockers to bypass state-of-the-art anti-adblockers

JavaScript Zero: Real JavaScript and Zero Side-Channel Attacks - Schwarz buff.ly/2DiEqON

We propose JavaScript Zero, a highly practical and generic fine-grained permission model in to reduce the attack surface in modern browsers.

Jessie Frazelle on SCONE: Secure Linux Containers with Intel SGX

paperswelove.org/2017/video/je

In 2016, the SCONE paper was written and presented at the USENIX Symposium on Operating Systems Design and Implementation. It outlined how to use Intel Secure Enclaves to guard containers against attack. Containers are built on the kernel primitives cgroups and namespaces with additional LSM (Linux Security Module) layers on top, such as AppArmor, SELinux, and seccomp.

David Ashby on SHA256

paperswelove.org/2017/video/da

While most of us use hash functions on a daily basis, few people can say that they truly understand what’s actually going on when they call SHA2("hello world"). Even fewer can say they’ve bothered to implement the function themselves, considering every introduction to cryptography starts off with a big warning saying to never, ever implement cryptographic primitives and just use vetted libraries due to the security implications.