Kartik Nayak

Orcid: 0000-0001-5675-263X

Affiliations:
  • Duke University, Durham, USA


According to our database1, Kartik Nayak authored at least 79 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sailfish: Towards Improving Latency of DAG-based BFT.
IACR Cryptol. ePrint Arch., 2024

The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange.
IACR Cryptol. ePrint Arch., 2024

Decentralization of Ethereum's Builder Market.
CoRR, 2024

Synchronous Distributed Key Generation without Broadcasts.
IACR Commun. Cryptol., 2024

Granular Synchrony.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Attacking and Improving the Tor Directory Protocol.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Lumiere: Making Optimal BFT for Partial Synchrony Practical.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Data Independent Order Policy Enforcement: Limitations and Solutions.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Communication complexity of byzantine agreement, revisited.
Distributed Comput., March, 2023

OptORAMa: Optimal Oblivious RAM.
J. ACM, February, 2023

Longshot: Indexing Growing Databases using MPC and Differential Privacy.
Proc. VLDB Endow., 2023

Private Proof-of-Stake Blockchains using Differentially-private Stake Distortion.
IACR Cryptol. ePrint Arch., 2023

Breaking the Chains of Rationality: Understanding the Limitations to and Obtaining Order Policy Enforcement.
IACR Cryptol. ePrint Arch., 2023

Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT.
IACR Cryptol. ePrint Arch., 2023

Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus.
IACR Cryptol. ePrint Arch., 2023

Communication and Round Efficient Parallel Broadcast Protocols.
IACR Cryptol. ePrint Arch., 2023

OptRand: Optimistically Responsive Reconfigurable Distributed Randomness.
Proceedings of the 30th Annual Network and Distributed System Security Symposium, 2023

2022
Locality-Preserving Oblivious RAM.
J. Cryptol., 2022

TrustBoost: Boosting Trust among Interoperable Blockchains.
IACR Cryptol. ePrint Arch., 2022

He-HTLC: Revisiting Incentives in HTLC.
IACR Cryptol. ePrint Arch., 2022

Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2022

Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin.
IACR Cryptol. ePrint Arch., 2022

OptRand: Optimistically responsive distributed random beacons.
IACR Cryptol. ePrint Arch., 2022

Empirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security.
CoRR, 2022

IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Empirical Analysis of EIP-1559: Transaction Fees, Waiting Times, and Consensus Security.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

On the Limitations of Logic Locking the Approximate Circuits.
Proceedings of the Asian Hardware Oriented Security and Trust Symposium, 2022

2021
Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption.
IACR Cryptol. ePrint Arch., 2021

On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols.
IACR Cryptol. ePrint Arch., 2021

Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults.
IACR Cryptol. ePrint Arch., 2021

Efficient Adaptively-Secure Byzantine Agreement for Long Messages.
IACR Cryptol. ePrint Arch., 2021

Optimal Good-case Latency for Rotating Leader Synchronous BFT.
IACR Cryptol. ePrint Arch., 2021

Classifying Trusted Hardware via Unidirectional Communication.
CoRR, 2021

Brief Note: Fast Authenticated Byzantine Consensus.
CoRR, 2021

Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Good-case Latency of Byzantine Broadcast: a Complete Categorization.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

BFT Protocol Forensics.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication.
Proceedings of the CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, November 15, 2021

2020
Perfectly Secure Oblivious Parallel RAM with O(log<sup>3</sup> N/ log log N) Overhead.
IACR Cryptol. ePrint Arch., 2020

RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication.
IACR Cryptol. ePrint Arch., 2020

On the Optimality of Optimistic Responsiveness.
IACR Cryptol. ePrint Arch., 2020

Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication.
CoRR, 2020

Improved Extension Protocols for Byzantine Broadcast and Agreement.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Sync HotStuff: Simple and Practical Synchronous State Machine Replication.
Proceedings of the 2020 IEEE Symposium on Security and Privacy, 2020

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Poirot: private contact summary aggregation: poster abstract.
Proceedings of the SenSys '20: The 18th ACM Conference on Embedded Networked Sensor Systems, 2020

2019
Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness.
IACR Cryptol. ePrint Arch., 2019

Flexible Byzantine Fault Tolerance.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

2018
Efficient Data-Oblivious Computation.
PhD thesis, 2018

Perfectly Secure Oblivious Parallel RAM.
IACR Cryptol. ePrint Arch., 2018

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting.
IACR Cryptol. ePrint Arch., 2018

OptORAMa: Optimal Oblivious RAM.
IACR Cryptol. ePrint Arch., 2018

Dfinity Consensus, Explored.
IACR Cryptol. ePrint Arch., 2018

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n<sup>2)</sup> Communication, and Optimal Resilience.
IACR Cryptol. ePrint Arch., 2018

2017
Practical Synchronous Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

Oblivious Computation with Data Locality.
IACR Cryptol. ePrint Arch., 2017

Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus.
IACR Cryptol. ePrint Arch., 2017

Brief Announcement: Practical Synchronous Byzantine Consensus.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Asymptotically Tight Bounds for Composing ORAM with PIR.
Proceedings of the Public-Key Cryptography - PKC 2017, 2017

HOP: Hardware makes Obfuscation Practical.
Proceedings of the 24th Annual Network and Distributed System Security Symposium, 2017

2016
An Oblivious RAM with Sub-logarithmic Bandwidth Blowup.
IACR Cryptol. ePrint Arch., 2016

An Oblivious Parallel RAM with O(log<sup>2</sup> N) Parallel Runtime Blowup.
IACR Cryptol. ePrint Arch., 2016

Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.
CoRR, 2016

Toward Semantic Cryptography APIs.
Proceedings of the IEEE Cybersecurity Development, 2016

Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks.
Proceedings of the 2016 ACM International Symposium on New Ideas, 2016

2015
iDASH Secure Genome Analysis Competition Using ObliVM.
IACR Cryptol. ePrint Arch., 2015

Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack.
IACR Cryptol. ePrint Arch., 2015

GraphSC: Parallel Secure Computation Made Easy.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

ObliVM: A Programming Framework for Secure Computation.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

2014
Oblivious Data Structures.
IACR Cryptol. ePrint Arch., 2014

Some Vulnerabilities Are Different Than Others - Studying Vulnerabilities and Attack Surfaces in the Wild.
Proceedings of the Research in Attacks, Intrusions and Defenses, 2014

Oblivious Data Structures.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014


  Loading...