Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Julian Williams

dblp:66/1026 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
0.312018
FuturesMEX: Secure, Distributed Futures Market Exchange · IEEE Symposium on Security and Privacy 2018
Cryptographic protocols and secure computation › secure multiparty computation
SPDZ
0.312018
FuturesMEX: Secure, Distributed Futures Market Exchange · IEEE Symposium on Security and Privacy 2018
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.312018
FuturesMEX: Secure, Distributed Futures Market Exchange · IEEE Symposium on Security and Privacy 2018
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › non-interactive zero-knowledge proofs
zk-SNARK
0.312018
FuturesMEX: Secure, Distributed Futures Market Exchange · IEEE Symposium on Security and Privacy 2018

Methods — techniques the papers use, named apart from their topics

zk-SNARK · 0.7distributed protocol · 0.7SPDZ · 0.7
YearPublicationVenuePosition
2018 FuturesMEX: Secure, Distributed Futures Market Exchange
abstract
In a Futures-Exchange, such as the Chicago Mercantile Exchange, traders buy and sell contractual promises (futures) to acquire or deliver, at some future pre-specified date, assets ranging from wheat to crude oil and from bacon to cash in a desired currency. The interactions between economic and security properties and the exchange's essentially non-monotonic security behavior; a valid trader's valid action can invalidate other traders' previously valid positions, are a challenge for security research. We show the security properties that guarantee an Exchange's economic viability (availability of trading information, liquidity, confidentiality of positions, absence of price discrimination, risk-management) and an attack when traders' anonymity is broken. We describe all key operations for a secure, fully distributed Futures-Exchange, hereafter referred to as simply the 'Exchange'. Our distributed, asynchronous protocol simulates the centralized functionality under the assumptions of anonymity of the physical layer and availability of a distributed ledger. We consider security with abort (in absence of honest majority) and extend it to penalties. Our proof of concept implementation and its optimization (based on zk-SNARKs and SPDZ) demonstrate that the computation of actual trading days (along Thomson-Reuters Tick History DB) is feasible for low-frequency markets; however, more research is needed for high-frequency ones.
Fabio Massacci, Chan Nam Ngo, Daniele Venturi 0001, Julian Williams
IEEE Symposium on Security and Privacy5