Elaine Shi

Tim Roughgarden

IACR Cryptol. ePrint Arch., 2024

Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy.

[BibT_eX]

[DOI]

CoRR, 2024

Mechanism Design for Automated Market Makers.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Oblivious RAM with Worst-Case Logarithmic Overhead.

[BibT_eX]

[DOI]

J. Cryptol., April, 2023

Communication complexity of byzantine agreement, revisited.

[BibT_eX]

[DOI]

Distributed Comput., March, 2023

OptORAMa: Optimal Oblivious RAM.

[BibT_eX]

[DOI]

J. ACM, February, 2023

A Core Calculus for Equational Proofs of Cryptographic Protocols.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., January, 2023

XCRYPT: Accelerating Lattice-Based Cryptography With Memristor Crossbar Arrays.

[BibT_eX]

[DOI]

Sarabjeet Singh

Xiong Fan

Ananth Krishna Prasad

Lin Jia

Anirban Nag

Rajeev Balasubramonian

Mahdi Nazm Bojnordi

IEEE Micro, 2023

Advanced Composition Theorems for Differential Obliviousness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Proof of Compliance for Anonymous, Unlinkable Messages.

[BibT_eX]

[DOI]

Mingxun Zhou

Giulia Fanti

IACR Cryptol. ePrint Arch., 2023

Piano: Extremely Simple, Single-Server PIR with Sublinear Server Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Maximizing Miner Revenue in Transaction Fee Mechanism Design.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Multi-Client Inner Product Encryption: Function-Hiding Instantiations Without Random Oracles.

[BibT_eX]

[DOI]

Nikhil Vanjani

IACR Cryptol. ePrint Arch., 2023

On the Amortized Communication Complexity of Byzantine Broadcast.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Can open decentralized ledgers be economically secure?

[BibT_eX]

[DOI]

Jacob Leshno

IACR Cryptol. ePrint Arch., 2023

Efficient Oblivious Sorting and Shuffling for Hardware Enclaves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Efficient Pre-processing PIR Without Public-Key Cryptography.

[BibT_eX]

[DOI]

Ashrujit Ghoshal

Mingxun Zhou

IACR Cryptol. ePrint Arch., 2023

Connected Components in Linear Work and Near-Optimal Time.

[BibT_eX]

[DOI]

Alireza Farhadi

S. Cliff Liu

CoRR, 2023

EnigMap: External-Memory Oblivious Map for Secure Enclaves.

[BibT_eX]

[DOI]

Afonso Tinoco

Sixiang Gao

Proceedings of the 32nd USENIX Security Symposium, 2023

Non-Interactive Anonymous Router with Quasi-Linear Router Computation.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Distributed-Prover Interactive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022

Sorting Short Keys in Circuits of Size ${o(n \log n)}$.

[BibT_eX]

[DOI]

Gilad Asharov

SIAM J. Comput., 2022

Differentially Oblivious Relational Database Operators.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2022

Locality-Preserving Oblivious RAM.

[BibT_eX]

[DOI]

J. Cryptol., 2022

Foundations of Differentially Oblivious Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2022

A Theory of Composition for Differential Obliviousness.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

The Power of the Differentially Oblivious Shuffle in Distributed Privacy Mechanisms.

[BibT_eX]

[DOI]

Mingxun Zhou

IACR Cryptol. ePrint Arch., 2022

Optimal Single-Server Private Information Retrieval.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

EnigMap: Signal Should Use Oblivious Algorithms for Private Contact Discovery.

[BibT_eX]

[DOI]

Afonso Tinoco

Sixiang Gao

IACR Cryptol. ePrint Arch., 2022

What Can Cryptography Do For Decentralized Mechanism Design?

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

NanoGRAM: Garbled RAM with $\widetilde{O}(\log N)$ Overhead.

[BibT_eX]

[DOI]

Andrew Park

IACR Cryptol. ePrint Arch., 2022

Efficient Dynamic Proof of Retrievability for Cold Storage.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Differentially Oblivious Turing Machines.

[BibT_eX]

[DOI]

Ilan Komargodski

IACR Cryptol. ePrint Arch., 2022

log*-Round Game-Theoretically-Fair Leader Election.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

MicroFedML: Privacy Preserving Federated Learning for Small Weights.

[BibT_eX]

[DOI]

Yue Guo

Antigoni Polychroniadou

David Byrd

Tucker Balch

IACR Cryptol. ePrint Arch., 2022

Non-Interactive Anonymous Router with Quasi-Linear Router Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Maliciously Secure Massively Parallel Computation for All-but-One Corruptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Rapidash: Improved Constructions for Side-Contract-Resilient Fair Exchange.

[BibT_eX]

[DOI]

Elisaweta Masserova

Sri Aravinda Krishnan Thyagarajan

IACR Cryptol. ePrint Arch., 2022

Ponyta: Foundations of Side-Contract-Resilient Fair Exchange.

[BibT_eX]

[DOI]

Elisaweta Masserova

Sri Aravinda Krishnan Thyagarajan

IACR Cryptol. ePrint Arch., 2022

Adore: Differentially Oblivious Relational Database Operators.

[BibT_eX]

[DOI]

CoRR, 2022

STAMP: Lightweight TEE-Assisted MPC for Efficient Privacy-Preserving Machine Learning.

[BibT_eX]

[DOI]

CoRR, 2022

Polynomial Commitment with a One-to-Many Prover and Applications.

[BibT_eX]

[DOI]

Proceedings of the 31st USENIX Security Symposium, 2022

Locally Differentially Private Sparse Vector Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

Optimal Sorting Circuits for Short Keys.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Revisiting the Power of Non-Equivocation in Distributed Protocols.

[BibT_eX]

[DOI]

Naama Ben-David

Benjamin Y. Chan

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

log *-Round Game-Theoretically-Fair Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

Differentially Private Densest Subgraph.

[BibT_eX]

[DOI]

Alireza Farhadi

MohammadTaghi Hajiaghayi

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss.

[BibT_eX]

[DOI]

Gilad Asharov

IACR Cryptol. ePrint Arch., 2021

Non-Interactive Anonymous Router.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

IPDL: A Simple Framework for Formally Verifying Distributed Cryptographic Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Foundations of Transaction Fee Mechanism Design.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Non-Interactive Differentially Anonymous Router.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Viaduct: An Extensible, Optimizing Compiler for Secure Distributed Programs (Technical Report).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

Sorting Short Keys in Circuits of Size o(n log n).

[BibT_eX]

[DOI]

Gilad Asharov

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Viaduct: an extensible, optimizing compiler for secure distributed programs.

[BibT_eX]

[DOI]

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Selfish Mining Attacks Exacerbated by Elastic Hash Supply.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2021

Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time.

[BibT_eX]

[DOI]

Balakrishnan Chandrasekaran

Waqar Aqeel

Bruce M. Maggs

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

Streamlet: An Absurdly Simple, Textbook Blockchain Protocol.

[BibT_eX]

[DOI]

Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021

2020

A Retrospective on Path ORAM.

[BibT_eX]

[DOI]

Marten van Dijk

Xiangyao Yu

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2020

Locally Decodable and Updatable Non-malleable Codes and Their Applications.

[BibT_eX]

[DOI]

J. Cryptol., 2020

Expected Constant Round Byzantine Broadcast under Dishonest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Puncturable Pseudorandom Sets and Private Information Retrieval with Polylogarithmic Bandwidth and Sublinear Time.

[BibT_eX]

[DOI]

Balakrishnan Chandrasekaran

Waqar Aqeel

Bruce M. Maggs

IACR Cryptol. ePrint Arch., 2020

Streamlined Blockchains: A Simple and Elegant Approach (A Tutorial and Survey).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Data Oblivious Algorithms for Multicores.

[BibT_eX]

[DOI]

Vijaya Ramachandran

IACR Cryptol. ePrint Arch., 2020

On the Adaptive Security of MACs and PRFs.

[BibT_eX]

[DOI]

Andrew Morgan

IACR Cryptol. ePrint Arch., 2020

Secure Massively Parallel Computation for Dishonest Majority.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Game-Theoretically Fair Leader Election in O(log log n) Rounds under Majority Coalitions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Streamlet: Textbook Streamlined Blockchains.

[BibT_eX]

[DOI]

Benjamin Y. Chan

Mohammad Taghi Hajiaghayi

IACR Cryptol. ePrint Arch., 2020

Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Blockchain with Varying Number of Players.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Optimal Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Oblivious Parallel Tight Compaction.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Lower bounds for external memory integer sorting via network coding.

[BibT_eX]

[DOI]

Alireza Farhadi

Kasper Green Larsen

Commun. ACM, 2020

Improved Extension Protocols for Byzantine Broadcast and Agreement.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Path Oblivious Heap: Optimal and Practical Oblivious Priority Queue.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels.

[BibT_eX]

[DOI]

Zhibin Liang

Antigoni Polychroniadou

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.

[BibT_eX]

[DOI]

Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Sublinear-Round Byzantine Agreement Under Corrupt Majority.

[BibT_eX]

[DOI]

Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Klotski: Efficient Obfuscated Execution against Controlled-Channel Attacks.

[BibT_eX]

[DOI]

Proceedings of the ASPLOS '20: Architectural Support for Programming Languages and Operating Systems, 2020

2019

Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Chang Liu

Uzi Vishkin

J. Cryptol., 2019

Path Oblivious Heap.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Synchronous, with a Chance of Partition Tolerance.

[BibT_eX]

[DOI]

Yue Guo

IACR Cryptol. ePrint Arch., 2019

IPDL: A Probabilistic Dataflow Logic for Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Round Complexity of Byzantine Agreement, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Consensus through Herding.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Towards Automated Safety Vetting of PLC Code in Real-World Plants.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

Snow White: Robustly Reconfigurable Consensus and Applications to Provably Secure Proof of Stake.

[BibT_eX]

[DOI]

Phil Daian

Proceedings of the Financial Cryptography and Data Security, 2019

Towards Attribute-Based Encryption for RAMs from LWE: Sub-linear Decryption, and More.

[BibT_eX]

[DOI]

Prabhanjan Ananth

Xiong Fan

Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018

Path ORAM: An Extremely Simple Oblivious RAM Protocol.

[BibT_eX]

[DOI]

Xiangyao Yu

J. ACM, 2018

Analysis of Deterministic Longest-Chain Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Rethinking Large-Scale Consensus.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Can We Overcome the n log n Barrier for Oblivious Sorting?

[BibT_eX]

[DOI]

Tiancheng Xie

IACR Cryptol. ePrint Arch., 2018

Game Theoretic Notions of Fairness in Multi-Party Coin Toss.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

PaLa: A Simple Partially Synchronous Blockchain.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

PiLi: An Extremely Simple Synchronous Blockchain.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Perfectly Secure Oblivious Parallel RAM.

[BibT_eX]

[DOI]

Kartik Nayak

IACR Cryptol. ePrint Arch., 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.

[BibT_eX]

[DOI]

Jonathan Katz

Kartik Nayak

Antigoni Polychroniadou

IACR Cryptol. ePrint Arch., 2018

Symbolic Proofs for Lattice-Based Cryptography.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

OptORAMa: Optimal Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Communication-Efficient Byzantine Agreement without Erasures.

[BibT_eX]

[DOI]

CoRR, 2018

xJsnark: A Framework for Efficient Verifiable Computation.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

2017

Distributed Private Data Analysis: Lower Bounds and Practical Constructions.

[BibT_eX]

[DOI]

Eleanor Gilbert Rieffel

ACM Trans. Algorithms, 2017

Thunderella: Blockchains with Optimistic Instant Confirmation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Oblivious Hashing Revisited, and Applications to Asymptotically Efficient ORAM and OPRAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Cache-Oblivious and Data-Oblivious Sorting and Applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

On the Depth of Oblivious Parallel RAM.

[BibT_eX]

[DOI]

Kai-Min Chung

IACR Cryptol. ePrint Arch., 2017

Solidus: Confidential Distributed Ledger Transactions via PVORM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs.

[BibT_eX]

[DOI]

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

HOP: Hardware makes Obfuscation Practical.

[BibT_eX]

[DOI]

Kartik Nayak

Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

The Sleepy Model of Consensus.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016

Town Crier: An Authenticated Data Feed for Smart Contracts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Formal Abstractions for Attested Execution Secure Processors.

[BibT_eX]

[DOI]

Florian Tramèr

IACR Cryptol. ePrint Arch., 2016

Hybrid Consensus: Efficient Consensus in the Permissionless Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

FruitChains: A Fair Blockchain.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

The Honey Badger of BFT Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

The Ring of Gyges: Investigating the Future of Criminal Smart Contracts.

[BibT_eX]

[DOI]

Ari Juels

IACR Cryptol. ePrint Arch., 2016

Circuit OPRAM: A (Somewhat) Tight Oblivious Parallel RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Snow White: Provably Secure Proofs of Stake.

[BibT_eX]

[DOI]

Iddo Bentov

IACR Cryptol. ePrint Arch., 2016

The Sleepy Model of Consensus.

[BibT_eX]

[DOI]

Iddo Bentov

IACR Cryptol. ePrint Arch., 2016

Characterizing Long-tail SEO Spam on Cloud Web Hosting Services.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM.

[BibT_eX]

[DOI]

Marten van Dijk

Daniel Wichs

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Understanding Craigslist Rental Scams.

[BibT_eX]

[DOI]

Youngsam Park

Damon McCoy

Proceedings of the Financial Cryptography and Data Security, 2016

On Scaling Decentralized Blockchains - (A Position Paper).

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2016

Case Study: Rental Scams.

[BibT_eX]

[DOI]

Proceedings of the Understanding Social Engineering Based Scams, 2016

Case Study: Sales Scams.

[BibT_eX]

[DOI]

Proceedings of the Understanding Social Engineering Based Scams, 2016

Identifying Scams and Trends.

[BibT_eX]

[DOI]

Proceedings of the Understanding Social Engineering Based Scams, 2016

2015

How to Authenticate any Data Structure.

[BibT_eX]

[DOI]

Tiny Trans. Comput. Sci., 2015

iDASH Secure Genome Analysis Competition Using ObliVM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Secure Dating with Four or Fewer Cards.

[BibT_eX]

[DOI]

Antonio Marcedone

Zikai Wen

IACR Cryptol. ePrint Arch., 2015

How to Use SNARKs in Universally Composable Protocols.

[BibT_eX]

[DOI]

Abhi Shelat

IACR Cryptol. ePrint Arch., 2015

Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Constant-Round MPC with Fairness and Guarantee of Output Delivery.

[BibT_eX]

[DOI]

S. Dov Gordon

Feng-Hao Liu

IACR Cryptol. ePrint Arch., 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Bucket ORAM: Single Online Roundtrip, Constant Bandwidth Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Step by Step Towards Creating a Safe Smart Contract: Lessons and Insights from a Cryptocurrency Lab.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Oblivious Network RAM.

[BibT_eX]

[DOI]

Dana Dachman-Soled

Chang Liu

Uzi Vishkin

IACR Cryptol. ePrint Arch., 2015

Constants Count: Practical Improvements to Oblivious RAM.

[BibT_eX]

[DOI]

Proceedings of the 24th USENIX Security Symposium, 2015

GraphSC: Parallel Secure Computation Made Easy.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

ObliVM: A Programming Framework for Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

Nonoutsourceable Scratch-Off Puzzles to Discourage Bitcoin Mining Coalitions.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

GhostRider: A Hardware-Software System for Memory Trace Oblivious Computation.

[BibT_eX]

[DOI]

Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015

2014

Joint Link Prediction and Attribute Inference Using a Social-Attribute Network.

[BibT_eX]

[DOI]

Eui Chul Richard Shin

ACM Trans. Intell. Syst. Technol., 2014

Oblivious Data Structures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

SCORAM: Oblivious RAM for Secure Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.

[BibT_eX]

[DOI]

Xiao Wang

IACR Cryptol. ePrint Arch., 2014

Ring ORAM: Closing the Gap Between Small and Large Client Storage Oblivious RAM.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

TRUESET: Nearly Practical Verifiable Set Computations.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

Mahmoud F. Sayed

Nikos Triandopoulos

IACR Cryptol. ePrint Arch., 2014

Pseudonymous Secure Computation from Time-Lock Puzzles.

[BibT_eX]

[DOI]

Jonathan Katz

Andrew Miller

IACR Cryptol. ePrint Arch., 2014

Adaptively Secure Fully Homomorphic Signatures Based on Lattices.

[BibT_eX]

[DOI]

Xavier Boyen

Xiong Fan

IACR Cryptol. ePrint Arch., 2014

Verifiable Oblivious Storage.

[BibT_eX]

[DOI]

Daniel Apon

Jonathan Katz

Aishwarya Thiruvengadam

IACR Cryptol. ePrint Arch., 2014

SDDR: Light-Weight, Secure Mobile Encounters.

[BibT_eX]

[DOI]

Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

TRUESET: Faster Verifiable Set Computations.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

Mahmoud F. Sayed

Nikos Triandopoulos

Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Burst ORAM: Minimizing ORAM Response Times for Bursty Access Patterns.

[BibT_eX]

[DOI]

Jonathan L. Dautrich Jr.

Nachikethas A. Jagadeesan

Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014

Permacoin: Repurposing Bitcoin Work for Data Preservation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

Automating Efficient RAM-Model Secure Computation.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Symposium on Security and Privacy, 2014

A secure computation framework for SDNs.

[BibT_eX]

[DOI]

Proceedings of the third workshop on Hot topics in software defined networking, 2014

Authenticated data structures, generically.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

Scambaiter: Understanding Targeted Nigerian Scams on Craigslist.

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Network and Distributed System Security Symposium, 2014

EnCore: private, context-based communication for mobile social apps.

[BibT_eX]

[DOI]

Proceedings of the 12th Annual International Conference on Mobile Systems, 2014

Multi-input Functional Encryption.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Oblivious Data Structures.

[BibT_eX]

[DOI]

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Emil Stefanov: Bridging the Theory and Practice of Cloud Computing Security.

[BibT_eX]

[DOI]

Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, 2014

ShadowCrypt: Encrypted Web Applications for Everyone.

[BibT_eX]

[DOI]

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

Practical Dynamic Searchable Encryption with Small Leakage.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Path ORAM: An Extremely Simple Oblivious RAM Protocol.

[BibT_eX]

[DOI]

Marten van Dijk

Xiangyao Yu

IACR Cryptol. ePrint Arch., 2013

Multi-Input Functional Encryption.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2013

Signatures of Correct Computation.

[BibT_eX]

[DOI]

Roberto Tamassia

Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

ObliviStore: High Performance Oblivious Cloud Storage.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Symposium on Security and Privacy, 2013

ObliviStore: High Performance Oblivious Distributed Cloud Data Store.

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Network and Distributed System Security Symposium, 2013

Streaming Authenticated Data Structures.

[BibT_eX]

[DOI]

Roberto Tamassia

Ke Yi

Proceedings of the Advances in Cryptology, 2013

Memory Trace Oblivious Program Execution.

[BibT_eX]

[DOI]

Chang Liu

Michael Hicks

Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

Multi-cloud oblivious storage.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Practical dynamic proofs of retrievability.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

Summary/overview for artificial intelligence and security (AISec'13).

[BibT_eX]

[DOI]

Blaine Nelson

Christos Dimitrakakis

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

PHANTOM: practical oblivious computation in a secure processor.

[BibT_eX]

[DOI]

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012

FastPRP: Fast Pseudo-Random Permutations for Small Domains.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Optimal Lower Bound for Differentially Private Multi-Party Aggregation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Path O-RAM: An Extremely Simple Oblivious RAM Protocol

[BibT_eX]

[DOI]

CoRR, 2012

Cloud Data Protection for the Masses.

[BibT_eX]

[DOI]

Computer, 2012

Context-centric Security.

[BibT_eX]

[DOI]

Proceedings of the 7th USENIX Workshop on Hot Topics in Security, 2012

GUPT: privacy preserving data analysis made easy.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

Towards Practical Oblivious RAM.

[BibT_eX]

[DOI]

Dawn Xiaodong Song

Proceedings of the 19th Annual Network and Distributed System Security Symposium, 2012

Opaak: using mobile phones to limit anonymous identities online.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Mobile Systems, 2012

Bitter to Better - How to Make Bitcoin a Better Currency.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2012

2011

Private and Continual Release of Statistics.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst. Secur., 2011

Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Oblivious RAM with O((log N)3) Worst-Case Cost.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Publicly Verifiable Delegation of Computation.

[BibT_eX]

[DOI]

Roberto Tamassia

IACR Cryptol. ePrint Arch., 2011

Privacy-Preserving Stream Aggregation with Fault Tolerance.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Predicting Links and Inferring Attributes using a Social-Attribute Network (SAN)

[BibT_eX]

[DOI]

Eui Chul Richard Shin

CoRR, 2011

Efficient and secure threshold-based event validation for VANETs.

[BibT_eX]

[DOI]

Proceedings of the Fourth ACM Conference on Wireless Network Security, 2011

Privacy settings from contextual attributes: A case study using Google Buzz.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual IEEE International Conference on Pervasive Computing and Communications, 2011

Privacy-Preserving Aggregation of Time-Series Data.

[BibT_eX]

[DOI]

Eleanor Gilbert Rieffel

Richard Chow

Proceedings of the Network and Distributed System Security Symposium, 2011

Link prediction by de-anonymization: How We Won the Kaggle Social Network Challenge.

[BibT_eX]

[DOI]

Arvind Narayanan

Benjamin I. P. Rubinstein

Proceedings of the 2011 International Joint Conference on Neural Networks, 2011

Do You Know Where Your Data Are? Secure Data Capsules for Deployable Data Protection.

[BibT_eX]

[DOI]

Proceedings of the 13th Workshop on Hot Topics in Operating Systems, 2011

Oblivious RAM with O((logN)3) Worst-Case Cost.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010

Implicit Authentication through Learning User Behavior.

[BibT_eX]

[DOI]

Proceedings of the Information Security - 13th International Conference, 2010

Signatures of Reputation.

[BibT_eX]

[DOI]

John Bethencourt

Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

Authentication in the clouds: a framework and its application to mobile users.

[BibT_eX]

[DOI]

Proceedings of the 2nd ACM Cloud Computing Security Workshop, 2010

2009

TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual IEEE Communications Society Conference on Sensor, 2009

Controlling data in the cloud: outsourcing computation without outsourcing control.

[BibT_eX]

[DOI]

Proceedings of the first ACM Cloud Computing Security Workshop, 2009

2008

Delegating Capabilities in Predicate Encryption Systems.

[BibT_eX]

[DOI]

Brent Waters

IACR Cryptol. ePrint Arch., 2008

Predicate Privacy in Encryption Systems.

[BibT_eX]

[DOI]

Emily Shen

Brent Waters

IACR Cryptol. ePrint Arch., 2008

2007

Multi-Dimensional Range Query over Encrypted Data.

[BibT_eX]

[DOI]

Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Portcullis: protecting connection setup from denial-of-capability attacks.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2007 Conference on Applications, 2007

2005

BIND: A Fine-Grained Attestation Service for Secure Distributed Systems.

[BibT_eX]

[DOI]

Adrian Perrig

Leendert van Doorn

Proceedings of the 2005 IEEE Symposium on Security and Privacy (S&P 2005), 2005

Detection of Denial-of-Message Attacks on Sensor Network Broadcasts.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE Symposium on Security and Privacy (S&P 2005), 2005

Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems.

[BibT_eX]

[DOI]

Proceedings of the 20th ACM Symposium on Operating Systems Principles 2005, 2005

2004

Designing secure sensor networks.

[BibT_eX]

[DOI]