default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKartik Nayak
Person information
- affiliation: Duke University, Durham, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j5]Nibesh Shrestha, Adithya Bhat, Aniket Kate, Kartik Nayak:
Synchronous Distributed Key Generation without Broadcasts. IACR Commun. Cryptol. 1(2): 19 (2024)- [c50]Andrew Lewis-Pye
, Dahlia Malkhi, Oded Naor, Kartik Nayak:
Lumiere: Making Optimal BFT for Partial Synchrony Practical. PODC 2024: 135-144 - [c49]Zhongtang Luo, Adithya Bhat, Kartik Nayak, Aniket Kate:
Attacking and Improving the Tor Directory Protocol. SP 2024: 3221-3237 - [c48]Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren:
Granular Synchrony. DISC 2024: 30:1-30:22 - [i54]Sen Yang, Kartik Nayak, Fan Zhang:
Decentralization of Ethereum's Builder Market. CoRR abs/2405.01329 (2024) - [i53]Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren:
Granular Synchrony. CoRR abs/2408.12853 (2024) - [i52]Nibesh Shrestha, Aniket Kate, Kartik Nayak:
Sailfish: Towards Improving Latency of DAG-based BFT. IACR Cryptol. ePrint Arch. 2024: 472 (2024) - [i51]Jeb Bearer, Benedikt Bünz, Philippe Camacho, Binyi Chen, Ellie Davidson, Ben Fisch, Brendon Fish, Gus Gutoski, Fernando Krell, Chengyu Lin, Dahlia Malkhi, Kartik Nayak, Keyao Shen, Alex Luoyuan Xiong, Nathan Yospe:
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange. IACR Cryptol. ePrint Arch. 2024: 1189 (2024) - 2023
- [j4]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication complexity of byzantine agreement, revisited. Distributed Comput. 36(1): 3-28 (2023) - [j3]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023) - [j2]Yanping Zhang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala:
Longshot: Indexing Growing Databases using MPC and Differential Privacy. Proc. VLDB Endow. 16(8): 2005-2018 (2023) - [c47]Erica Blum, Jonathan Katz, Julian Loss, Kartik Nayak, Simon Ochsenreither:
Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus. CCS 2023: 519-533 - [c46]Peiyao Sheng, Xuechao Wang, Sreeram Kannan, Kartik Nayak, Pramod Viswanath:
TrustBoost: Boosting Trust among Interoperable Blockchains. CCS 2023: 1571-1584 - [c45]Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, Pramod Viswanath:
Player-Replaceability and Forensic Support Are Two Sides of the Same (Crypto) Coin. FC (1) 2023: 56-74 - [c44]Adithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik Nayak:
OptRand: Optimistically Responsive Reconfigurable Distributed Randomness. NDSS 2023 - [c43]Sarisht Wadhwa, Jannis Stoeter, Fan Zhang, Kartik Nayak:
He-HTLC: Revisiting Incentives in HTLC. NDSS 2023 - [c42]Shravan Srinivasan, Julian Loss, Giulio Malavolta, Kartik Nayak, Charalampos Papamanthou, Sri Aravinda Krishnan Thyagarajan:
Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus. Public Key Cryptography (1) 2023: 554-584 - [c41]Chenghong Wang, David Pujol, Kartik Nayak, Ashwin Machanavajjhala:
Private Proof-of-Stake Blockchains using Differentially-Private Stake Distortion. USENIX Security Symposium 2023: 1577-1594 - [i50]Andrew Lewis-Pye, Dahlia Malkhi, Oded Naor, Kartik Nayak:
Lumiere: Making Optimal BFT for Partial Synchrony Practical. CoRR abs/2311.08091 (2023) - [i49]Dahlia Malkhi, Kartik Nayak:
Extended Abstract: HotStuff-2: Optimal Two-Phase Responsive BFT. IACR Cryptol. ePrint Arch. 2023: 397 (2023) - [i48]Erica Blum, Jonathan Katz, Julian Loss, Kartik Nayak, Simon Ochsenreither:
Abraxas: Throughput-Efficient Hybrid Asynchronous Consensus. IACR Cryptol. ePrint Arch. 2023: 689 (2023) - [i47]Chenghong Wang, David Pujol, Kartik Nayak, Ashwin Machanavajjhala:
Private Proof-of-Stake Blockchains using Differentially-private Stake Distortion. IACR Cryptol. ePrint Arch. 2023: 787 (2023) - [i46]Sarisht Wadhwa, Luca Zanolini, Francesco D'Amato, Aditya Asgaonkar, Fan Zhang, Kartik Nayak:
Breaking the Chains of Rationality: Understanding the Limitations to and Obtaining Order Policy Enforcement. IACR Cryptol. ePrint Arch. 2023: 868 (2023) - [i45]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Communication and Round Efficient Parallel Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1172 (2023) - 2022
- [j1]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. J. Cryptol. 35(2): 6 (2022) - [c40]Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak:
Efficient Adaptively-Secure Byzantine Agreement for Long Messages. ASIACRYPT (1) 2022: 504-525 - [c39]Kartik Nayak, Devanshi Upadhyaya, Francesco Regazzoni, Ilia Polian:
On the Limitations of Logic Locking the Approximate Circuits. AsianHOST 2022: 1-6 - [c38]Yulin Liu, Yuxuan Lu, Kartik Nayak, Fan Zhang, Luyao Zhang, Yinhong Zhao:
Empirical Analysis of EIP-1559: Transaction Fees, Waiting Times, and Consensus Security. CCS 2022: 2099-2113 - [c37]Sravya Yandamuri, Ittai Abraham, Kartik Nayak, Michael K. Reiter:
Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption. OPODIS 2022: 24:1-24:23 - [c36]Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala:
IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy. SIGMOD Conference 2022: 818-832 - [i44]Yulin Liu, Yuxuan Lu, Kartik Nayak, Fan Zhang, Luyao Zhang, Yinhong Zhao:
Empirical Analysis of EIP-1559: Transaction Fees, Waiting Time, and Consensus Security. CoRR abs/2201.05574 (2022) - [i43]Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala:
IncShrink: Architecting Efficient Outsourced Databases using Incremental MPC and Differential Privacy. CoRR abs/2203.05084 (2022) - [i42]Xuechao Wang, Peiyao Sheng, Sreeram Kannan, Kartik Nayak, Pramod Viswanath:
TrustBoost: Boosting Trust among Interoperable Blockchains. CoRR abs/2210.11571 (2022) - [i41]Adithya Bhat, Aniket Kate, Kartik Nayak, Nibesh Shrestha:
OptRand: Optimistically responsive distributed random beacons. IACR Cryptol. ePrint Arch. 2022: 193 (2022) - [i40]Sarisht Wadhwa, Jannis Stoeter, Fan Zhang, Kartik Nayak:
He-HTLC: Revisiting Incentives in HTLC. IACR Cryptol. ePrint Arch. 2022: 546 (2022) - [i39]Shravan Srinivasan, Julian Loss, Giulio Malavolta, Kartik Nayak, Charalampos Papamanthou, Sri Aravinda Krishnan Thyagarajan:
Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus. IACR Cryptol. ePrint Arch. 2022: 1421 (2022) - [i38]Xuechao Wang, Peiyao Sheng, Sreeram Kannan, Kartik Nayak, Pramod Viswanath:
TrustBoost: Boosting Trust among Interoperable Blockchains. IACR Cryptol. ePrint Arch. 2022: 1428 (2022) - [i37]Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, Pramod Viswanath:
Player-Replaceability and Forensic Support are Two Sides of the Same (Crypto) Coin. IACR Cryptol. ePrint Arch. 2022: 1513 (2022) - 2021
- [c35]Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, Pramod Viswanath:
BFT Protocol Forensics. CCS 2021: 1722-1743 - [c34]Adithya Bhat, Nibesh Shrestha, Zhongtang Luo, Aniket Kate, Kartik Nayak:
RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. CCS 2021: 3502-3524 - [c33]T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak:
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. ITC 2021: 8:1-8:23 - [c32]Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. ICDCS 2021: 205-215 - [c31]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-Case Latency for Rotating Leader Synchronous BFT. OPODIS 2021: 27:1-27:19 - [c30]Naama Ben-David, Kartik Nayak:
Brief Announcement: Classifying Trusted Hardware via Unidirectional Communication. PODC 2021: 191-194 - [c29]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. PODC 2021: 331-341 - [c28]Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha:
Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. PODC 2021: 375-377 - [c27]Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala:
DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy. SIGMOD Conference 2021: 1892-1905 - [c26]Markulf Kohlweiss, Varun Madathil, Kartik Nayak, Alessandra Scafuro:
On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols. SP 2021: 1818-1833 - [c25]Sravya Yandamuri, Ittai Abraham, Kartik Nayak, Michael K. Reiter:
Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption. DISC 2021: 62:1-62:4 - [i36]Zhuolun Xiang, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Strengthened Fault Tolerance in Byzantine Fault Tolerant Replication. CoRR abs/2101.03715 (2021) - [i35]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. CoRR abs/2102.07240 (2021) - [i34]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Note: Fast Authenticated Byzantine Consensus. CoRR abs/2102.07932 (2021) - [i33]Chenghong Wang, Johes Bater, Kartik Nayak, Ashwin Machanavajjhala:
DP-Sync: Hiding Update Patterns in Secure Outsourced Databases with Differential Privacy. CoRR abs/2103.15942 (2021) - [i32]Naama Ben-David, Kartik Nayak:
Classifying Trusted Hardware via Unidirectional Communication. CoRR abs/2105.10566 (2021) - [i31]Sravya Yandamuri, Ittai Abraham, Kartik Nayak, Michael K. Reiter:
Communication-Efficient BFT Protocols Using Small Trusted Hardware to Tolerate Minority Corruption. IACR Cryptol. ePrint Arch. 2021: 184 (2021) - [i30]Markulf Kohlweiss, Varun Madathil, Kartik Nayak, Alessandra Scafuro:
On the Anonymity Guarantees of Anonymous Proof-of-Stake Protocols. IACR Cryptol. ePrint Arch. 2021: 409 (2021) - [i29]Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha:
Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults. IACR Cryptol. ePrint Arch. 2021: 603 (2021) - [i28]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-case Latency for Rotating Leader Synchronous BFT. IACR Cryptol. ePrint Arch. 2021: 1138 (2021) - [i27]Amey Bhangale, Chen-Da Liu-Zhang, Julian Loss, Kartik Nayak:
Efficient Adaptively-Secure Byzantine Agreement for Long Messages. IACR Cryptol. ePrint Arch. 2021: 1403 (2021) - [i26]Nibesh Shrestha, Adithya Bhat, Aniket Kate, Kartik Nayak:
Synchronous Distributed Key Generation without Broadcasts. IACR Cryptol. ePrint Arch. 2021: 1635 (2021) - 2020
- [c24]Nibesh Shrestha, Ittai Abraham, Ling Ren, Kartik Nayak:
On the Optimality of Optimistic Responsiveness. CCS 2020: 839-857 - [c23]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) 2020: 403-432 - [c22]Yanping Zhang, Chenghong Wang, David Pujol, Johes Bater, Matthew Lentz, Ashwin Machanavajjhala, Kartik Nayak, Lavanya Vasudevan, Jun Yang:
Poirot: private contact summary aggregation: poster abstract. SenSys 2020: 774-775 - [c21]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. SOSA 2020: 8-14 - [c20]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Maofan Yin:
Sync HotStuff: Simple and Practical Synchronous State Machine Replication. SP 2020: 106-118 - [c19]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. DISC 2020: 28:1-28:17 - [c18]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. DISC 2020: 47:1-47:3 - [i25]Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, Zhuolun Xiang:
Improved Extension Protocols for Byzantine Broadcast and Agreement. CoRR abs/2002.11321 (2020) - [i24]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. CoRR abs/2003.13155 (2020) - [i23]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. CoRR abs/2008.01765 (2020) - [i22]Peiyao Sheng, Gerui Wang, Kartik Nayak, Sreeram Kannan, Pramod Viswanath:
BFT Protocol Forensics. CoRR abs/2010.06785 (2020) - [i21]Ittai Abraham, Kartik Nayak, Ling Ren, Nibesh Shrestha:
On the Optimality of Optimistic Responsiveness. IACR Cryptol. ePrint Arch. 2020: 458 (2020) - [i20]T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM with O(log3 N/ log log N) Overhead. IACR Cryptol. ePrint Arch. 2020: 604 (2020) - [i19]Adithya Bhat, Nibesh Shrestha, Aniket Kate, Kartik Nayak:
RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. IACR Cryptol. ePrint Arch. 2020: 1590 (2020)
2010 – 2019
- 2019
- [c17]Dahlia Malkhi, Kartik Nayak, Ling Ren:
Flexible Byzantine Fault Tolerance. CCS 2019: 1041-1053 - [c16]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Locality-Preserving Oblivious RAM. EUROCRYPT (2) 2019: 214-243 - [c15]Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, Ling Ren:
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. Financial Cryptography 2019: 320-334 - [c14]Ittai Abraham, T.-H. Hubert Chan, Danny Dolev, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Communication Complexity of Byzantine Agreement, Revisited. PODC 2019: 317-326 - [i18]Dahlia Malkhi, Kartik Nayak, Ling Ren:
Flexible Byzantine Fault Tolerance. CoRR abs/1904.10067 (2019) - [i17]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Maofan Yin:
Sync HotStuff: Synchronous SMR with 2∆ Latency and Optimistic Responsiveness. IACR Cryptol. ePrint Arch. 2019: 270 (2019) - 2018
- [b1]Kartik Nayak:
Efficient Data-Oblivious Computation. University of Maryland, College Park, MD, USA, 2018 - [c13]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-server Setting. ASIACRYPT (3) 2018: 158-188 - [c12]T.-H. Hubert Chan, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM. TCC (2) 2018: 636-668 - [i16]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. CoRR abs/1809.00825 (2018) - [i15]T.-H. Hubert Chan, Kartik Nayak, Elaine Shi:
Perfectly Secure Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2018: 364 (2018) - [i14]T.-H. Hubert Chan, Jonathan Katz, Kartik Nayak, Antigoni Polychroniadou, Elaine Shi:
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting. IACR Cryptol. ePrint Arch. 2018: 851 (2018) - [i13]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. 2018: 892 (2018) - [i12]Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, Ling Ren:
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. IACR Cryptol. ePrint Arch. 2018: 1028 (2018) - [i11]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Dfinity Consensus, Explored. IACR Cryptol. ePrint Arch. 2018: 1153 (2018) - 2017
- [c11]Kartik Nayak, Christopher W. Fletcher, Ling Ren, Nishanth Chandran, Satya V. Lokam, Elaine Shi, Vipul Goyal:
HOP: Hardware makes Obfuscation Practical. NDSS 2017 - [c10]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Alexander Spiegelman:
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. OPODIS 2017: 25:1-25:19 - [c9]Ittai Abraham, Christopher W. Fletcher, Kartik Nayak, Benny Pinkas, Ling Ren:
Asymptotically Tight Bounds for Composing ORAM with PIR. Public Key Cryptography (1) 2017: 91-120 - [c8]Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren:
Brief Announcement: Practical Synchronous Byzantine Consensus. DISC 2017: 41:1-41:4 - [i10]Ling Ren, Kartik Nayak, Ittai Abraham, Srinivas Devadas:
Practical Synchronous Byzantine Consensus. CoRR abs/1704.02397 (2017) - [i9]Ling Ren, Kartik Nayak, Ittai Abraham, Srinivas Devadas:
Practical Synchronous Byzantine Consensus. IACR Cryptol. ePrint Arch. 2017: 307 (2017) - [i8]Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi:
Oblivious Computation with Data Locality. IACR Cryptol. ePrint Arch. 2017: 772 (2017) - [i7]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Alexander Spiegelman:
Solida: A Blockchain Protocol Based on Reconfigurable Byzantine Consensus. IACR Cryptol. ePrint Arch. 2017: 1118 (2017) - 2016
- [c7]Kartik Nayak, Srijan Kumar, Andrew Miller, Elaine Shi:
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack. EuroS&P 2016: 305-320 - [c6]Soumya Indela, Mukul Kulkarni, Kartik Nayak, Tudor Dumitras:
Helping Johnny encrypt: toward semantic interfaces for cryptographic frameworks. Onward! 2016: 180-196 - [c5]Soumya Indela, Mukul Kulkarni, Kartik Nayak, Tudor Dumitras:
Toward Semantic Cryptography APIs. SecDev 2016: 9-14 - [i6]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Alexander Spiegelman:
Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus. CoRR abs/1612.02916 (2016) - [i5]Kartik Nayak, Ling Ren, Ittai Abraham, Benny Pinkas:
An Oblivious RAM with Sub-logarithmic Bandwidth Blowup. IACR Cryptol. ePrint Arch. 2016: 849 (2016) - [i4]Kartik Nayak, Jonathan Katz:
An Oblivious Parallel RAM with O(log2 N) Parallel Runtime Blowup. IACR Cryptol. ePrint Arch. 2016: 1141 (2016) - 2015
- [c4]Chang Liu, Xiao Shaun Wang, Kartik Nayak, Yan Huang, Elaine Shi:
ObliVM: A Programming Framework for Secure Computation. IEEE Symposium on Security and Privacy 2015: 359-376 - [c3]Kartik Nayak, Xiao Shaun Wang, Stratis Ioannidis, Udi Weinsberg, Nina Taft, Elaine Shi:
GraphSC: Parallel Secure Computation Made Easy. IEEE Symposium on Security and Privacy 2015: 377-394 - [i3]Xiao Shaun Wang, Chang Liu, Kartik Nayak, Yan Huang, Elaine Shi:
iDASH Secure Genome Analysis Competition Using ObliVM. IACR Cryptol. ePrint Arch. 2015: 191 (2015) - [i2]Kartik Nayak, Srijan Kumar, Andrew Miller, Elaine Shi:
Stubborn Mining: Generalizing Selfish Mining and Combining with an Eclipse Attack. IACR Cryptol. ePrint Arch. 2015: 796 (2015) - 2014
- [c2]Xiao Shaun Wang, Kartik Nayak, Chang Liu, T.-H. Hubert Chan, Elaine Shi, Emil Stefanov, Yan Huang:
Oblivious Data Structures. CCS 2014: 215-226 - [c1]Kartik Nayak, Daniel Marino, Petros Efstathopoulos, Tudor Dumitras:
Some Vulnerabilities Are Different Than Others - Studying Vulnerabilities and Attack Surfaces in the Wild. RAID 2014: 426-446 - [i1]Xiao Wang, Kartik Nayak, Chang Liu, Elaine Shi, Emil Stefanov, Yan Huang:
Oblivious Data Structures. IACR Cryptol. ePrint Arch. 2014: 185 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
