default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIttai Abraham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c112]Ittai Abraham, Gilad Asharov
, Shravani Patil, Arpita Patra:
Perfect Asynchronous MPC with Linear Communication Overhead. EUROCRYPT (5) 2024: 280-309- [c111]Neil Giridharan, Florian Suri-Payer, Ittai Abraham, Lorenzo Alvisi, Natacha Crooks:
Autobahn: Seamless high speed BFT. SOSP 2024: 1-23 - [c110]Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern:
Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC. TCC (4) 2024: 451-482 - [c109]Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren:
Granular Synchrony. DISC 2024: 30:1-30:22 - [i65]Neil Giridharan, Florian Suri-Payer, Ittai Abraham, Lorenzo Alvisi, Natacha Crooks:
Motorway: Seamless high speed BFT. CoRR abs/2401.10369 (2024) - [i64]Neil Giridharan, Ittai Abraham, Natacha Crooks, Kartik Nayak, Ling Ren:
Granular Synchrony. CoRR abs/2408.12853 (2024) - [i63]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Perfect Asynchronous MPC with Linear Communication Overhead. IACR Cryptol. ePrint Arch. 2024: 432 (2024) - 2023
- [j28]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) - [j27]Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching consensus for asynchronous distributed key generation. Distributed Comput. 36(3): 219-252 (2023) - [j26]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Corrigendum: Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 52(5): 1319-1320 (2023) - [c108]Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern:
Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation. CRYPTO (1) 2023: 39-70 - [c107]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. EUROCRYPT (2) 2023: 251-281 - [c106]Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. OPODIS 2023: 14:1-14:16 - [c105]Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. OPODIS 2023: 29:1-29:21 - [c104]Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham, Natacha Crooks:
BeeGees: Stayin' Alive in Chained BFT. PODC 2023: 233-243 - [c103]Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern:
Colordag: An Incentive-Compatible Blockchain. DISC 2023: 1:1-1:22 - [i62]Andrew Lewis-Pye, Ittai Abraham:
Fever: Optimal Responsive View Synchronisation. CoRR abs/2301.09881 (2023) - [i61]Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern:
Colordag: An Incentive-Compatible Blockchain. CoRR abs/2308.11379 (2023) - [i60]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. IACR Cryptol. ePrint Arch. 2023: 557 (2023) - [i59]Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern:
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. IACR Cryptol. ePrint Arch. 2023: 1130 (2023) - [i58]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Communication and Round Efficient Parallel Broadcast Protocols. IACR Cryptol. ePrint Arch. 2023: 1172 (2023) - [i57]Ittai Abraham, Naama Ben-David, Gilad Stern, Sravya Yandamuri:
On the Round Complexity of Asynchronous Crusader Agreement. IACR Cryptol. ePrint Arch. 2023: 1586 (2023) - 2022
- [j25]Ittai Abraham, Danny Dolev, Gilad Stern:
Revisiting asynchronous fault tolerant computation with optimal resilience. Distributed Comput. 35(4): 333-355 (2022) - [j24]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. J. Cryptol. 35(4): 27 (2022) - [j23]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. SIAM J. Comput. 51(2): 290-314 (2022) - [c102]Ittai Abraham:
Reflections on the Past, Present and Future of Blockchain Foundations and Applications (Invited Talk). FAB 2022: 1:1-1:1 - [c101]Ittai Abraham, Gilad Stern:
New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks. OPODIS 2022: 16:1-16:18 - [c100]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 - [c99]Ittai Abraham, Naama Ben-David, Sravya Yandamuri:
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. PODC 2022: 381-391 - [c98]Ittai Abraham, Gilad Asharov:
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. PODC 2022: 392-398 - [c97]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC (1) 2022: 384-414 - [c96]Ittai Abraham, Danny Dolev, Alon Kagan, Gilad Stern:
Brief Announcement: Authenticated Consensus in Synchronous Systems with Mixed Faults. DISC 2022: 38:1-38:3 - [c95]Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, Florian Suri-Payer:
Brief Announcement: It's not easy to relax: liveness in chained BFT protocols. DISC 2022: 39:1-39:3 - [i56]Ittai Abraham, Natacha Crooks, Neil Giridharan, Heidi Howard, Florian Suri-Payer:
It's not easy to relax: liveness in chained BFT protocols. CoRR abs/2205.11652 (2022) - [i55]Ittai Abraham, Gilad Asharov:
Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. IACR Cryptol. ePrint Arch. 2022: 264 (2022) - [i54]Ittai Abraham, Danny Dolev, Ittay Eyal, Joseph Y. Halpern:
Colordag: An Incentive-Compatible Blockchain. IACR Cryptol. ePrint Arch. 2022: 308 (2022) - [i53]Alin Tomescu, Adithya Bhat, Benny Applebaum, Ittai Abraham, Guy Gueta, Benny Pinkas, Avishay Yanai:
UTT: Decentralized Ecash with Accountable Privacy. IACR Cryptol. ePrint Arch. 2022: 452 (2022) - [i52]Ittai Abraham, Naama Ben-David, Sravya Yandamuri:
Efficient and Adaptively Secure Asynchronous Binary Agreement via Binding Crusader Agreement. IACR Cryptol. ePrint Arch. 2022: 711 (2022) - [i51]Gilad Stern, Ittai Abraham:
New Dolev-Reischuk Lower Bounds Meet Blockchain Eclipse Attacks. IACR Cryptol. ePrint Arch. 2022: 730 (2022) - [i50]Ittai Abraham, Danny Dolev, Alon Kagan, Gilad Stern:
Authenticated Consensus in Synchronous Systems with Mixed Faults. IACR Cryptol. ePrint Arch. 2022: 805 (2022) - [i49]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. IACR Cryptol. ePrint Arch. 2022: 1266 (2022) - [i48]Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern:
Bingo: Adaptively Secure Packed Asynchronous Verifiable Secret Sharing and Asynchronous Distributed Key Generation. IACR Cryptol. ePrint Arch. 2022: 1759 (2022) - 2021
- [c94]Ittai Abraham, Ling Ren, Zhuolun Xiang:
Good-Case and Bad-Case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. OPODIS 2021: 5:1-5:20 - [c93]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-Case Latency for Rotating Leader Synchronous BFT. OPODIS 2021: 27:1-27:19 - [c92]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. PODC 2021: 331-341 - [c91]Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching Consensus for Asynchronous Distributed Key Generation. PODC 2021: 363-373 - [c90]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. TCC (2) 2021: 66-96 - [c89]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 - [i47]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Good-case Latency of Byzantine Broadcast: a Complete Categorization. CoRR abs/2102.07240 (2021) - [i46]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Brief Note: Fast Authenticated Byzantine Consensus. CoRR abs/2102.07932 (2021) - [i45]Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu:
Reaching Consensus for Asynchronous Distributed Key Generation. CoRR abs/2102.09041 (2021) - [i44]Ittai Abraham, Ling Ren, Zhuolun Xiang:
Good-case and Bad-case Latency of Unauthenticated Byzantine Broadcast: A Complete Categorization. CoRR abs/2109.12454 (2021) - [i43]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) - [i42]Ittai Abraham, Kartik Nayak, Nibesh Shrestha:
Optimal Good-case Latency for Rotating Leader Synchronous BFT. IACR Cryptol. ePrint Arch. 2021: 1138 (2021) - [i41]Ittai Abraham, Gilad Asharov, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. IACR Cryptol. ePrint Arch. 2021: 1206 (2021) - [i40]Neil Giridharan, Heidi Howard, Ittai Abraham, Natacha Crooks, Alin Tomescu:
No-Commit Proofs: Defeating Livelock in BFT. IACR Cryptol. ePrint Arch. 2021: 1308 (2021) - 2020
- [j22]Ittai Abraham, Susan Athey, Moshe Babaioff, Michael Grubb:
Peaches, lemons, and cookies: Designing auction markets with dispersed information. Games Econ. Behav. 124: 454-477 (2020) - [j21]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and Their Applications. ACM Trans. Algorithms 16(2): 19:1-19:21 (2020) - [c88]Nibesh Shrestha, Ittai Abraham, Ling Ren, Kartik Nayak:
On the Optimality of Optimistic Responsiveness. CCS 2020: 839-857 - [c87]Ittai Abraham, Benny Pinkas, Avishay Yanai:
Blinder - Scalable, Robust Anonymous Committed Broadcast. CCS 2020: 1233-1252 - [c86]Ittai Abraham, Gilad Stern:
Information Theoretic HotStuff. OPODIS 2020: 11:1-11:16 - [c85]Ittai Abraham, Danny Dolev, Gilad Stern:
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. PODC 2020: 139-148 - [c84]Alin Tomescu, Ittai Abraham, Vitalik Buterin, Justin Drake, Dankrad Feist, Dmitry Khovratovich:
Aggregatable Subvector Commitments for Stateless Cryptocurrencies. SCN 2020: 45-64 - [c83]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, Maofan Yin:
Sync HotStuff: Simple and Practical Synchronous State Machine Replication. SP 2020: 106-118 - [c82]Alin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham, Benny Pinkas, Guy Golan-Gueta, Srinivas Devadas:
Towards Scalable Threshold Cryptosystems. SP 2020: 877-893 - [c81]Ittai Abraham:
When Nakamoto Meets Nash: Blockchain Breakthrough Through the Lens of Game Theory (Invited Talk). Tokenomics 2020: 2:1-2:1 - [c80]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 - [i39]Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang:
Optimal Good-case Latency for Byzantine Broadcast and State Machine Replication. CoRR abs/2003.13155 (2020) - [i38]Ittai Abraham, Danny Dolev, Gilad Stern:
Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience. CoRR abs/2006.16686 (2020) - [i37]Ittai Abraham, Gilad Stern:
Information Theoretic HotStuff. CoRR abs/2009.12828 (2020) - [i36]Ittai Abraham, Benny Pinkas, Avishay Yanai:
Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast. IACR Cryptol. ePrint Arch. 2020: 248 (2020) - [i35]Ittai Abraham, Kartik Nayak, Ling Ren, Nibesh Shrestha:
On the Optimality of Optimistic Responsiveness. IACR Cryptol. ePrint Arch. 2020: 458 (2020) - [i34]Alin Tomescu, Ittai Abraham, Vitalik Buterin, Justin Drake, Dankrad Feist, Dmitry Khovratovich:
Aggregatable Subvector Commitments for Stateless Cryptocurrencies. IACR Cryptol. ePrint Arch. 2020: 527 (2020)
2010 – 2019
- 2019
- [j20]Ittai Abraham, Ofer Neiman:
Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM J. Comput. 48(2): 227-248 (2019) - [j19]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. SIAM J. Comput. 48(3): 1120-1145 (2019) - [j18]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Distributed Protocols for Leader Election: A Game-Theoretic Perspective. ACM Trans. Economics and Comput. 7(1): 4:1-4:26 (2019) - [c79]Soumya Basu, Alin Tomescu, Ittai Abraham, Dahlia Malkhi, Michael K. Reiter, Emin Gün Sirer:
Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols. CCS 2019: 2387-2402 - [c78]Guy Golan-Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K. Reiter, Dragos-Adrian Seredinschi, Orr Tamir, Alin Tomescu:
SBFT: A Scalable and Decentralized Trust Infrastructure. DSN 2019: 568-580 - [c77]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 - [c76]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 - [c75]Ittai Abraham, Dahlia Malkhi, Alexander Spiegelman:
Asymptotically Optimal Validated Asynchronous Byzantine Agreement. PODC 2019: 337-346 - [c74]Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, Ittai Abraham:
HotStuff: BFT Consensus with Linearity and Responsiveness. PODC 2019: 347-356 - [c73]Ittai Abraham, Danny Dolev, Ivan Geffner, Joseph Y. Halpern:
Implementing Mediators with Asynchronous Cheap Talk. PODC 2019: 501-510 - [i33]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) - [i32]Eleftherios Kokoris-Kogias, Alexander Spiegelman, Dahlia Malkhi, Ittai Abraham:
Bootstrapping Consensus Without Trusted Setup: Fully Asynchronous Distributed Key Generation. IACR Cryptol. ePrint Arch. 2019: 1015 (2019) - 2018
- [j17]Shelly Grossman, Ittai Abraham, Guy Golan-Gueta, Yan Michalevsky, Noam Rinetzky, Mooly Sagiv, Yoni Zohar:
Online detection of effectively callback free objects with applications to smart contracts. Proc. ACM Program. Lang. 2(POPL): 48:1-48:28 (2018) - [c72]Yotam Harchol, Ittai Abraham, Benny Pinkas:
Distributed SSH Key Management with Proactive RSA Threshold Signatures. ACNS 2018: 22-43 - [c71]Pandian Raju, Soujanya Ponnapalli, Evan Kaminsky, Gilad Oved, Zachary Keener, Vijay Chidambaram, Ittai Abraham:
mLSM: Making Authenticated Storage Faster in Ethereum. HotStorage 2018 - [c70]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. SODA 2018: 1650-1664 - [c69]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric embedding via shortest path decompositions. STOC 2018: 952-963 - [i31]Shelly Grossman, Ittai Abraham, Guy Golan-Gueta, Yan Michalevsky, Noam Rinetzky, Mooly Sagiv, Yoni Zohar:
Online Detection of Effectively Callback Free Objects with Applications to Smart Contracts. CoRR abs/1801.04032 (2018) - [i30]Ittai Abraham, Guy Gueta, Dahlia Malkhi, Jean-Philippe Martin:
Revisiting Fast Practical Byzantine Fault Tolerance: Thelma, Velma, and Zelma. CoRR abs/1801.10022 (2018) - [i29]Ittai Abraham, Guy Gueta, Dahlia Malkhi:
Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil. CoRR abs/1803.05069 (2018) - [i28]Guy Golan-Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K. Reiter, Dragos-Adrian Seredinschi, Orr Tamir, Alin Tomescu:
SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains. CoRR abs/1804.01626 (2018) - [i27]Ittai Abraham, Danny Dolev, Ivan Geffner, Joseph Y. Halpern:
Implementing Mediators with Asynchronous Cheap Talk. CoRR abs/1806.01214 (2018) - [i26]Ittai Abraham, Dahlia Malkhi, Alexander Spiegelman:
Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication. CoRR abs/1811.01332 (2018) - [i25]Yotam Harchol, Ittai Abraham, Benny Pinkas:
Distributed SSH Key Management with Proactive RSA Threshold Signatures. IACR Cryptol. ePrint Arch. 2018: 389 (2018) - [i24]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) - [i23]Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren:
Dfinity Consensus, Explored. IACR Cryptol. ePrint Arch. 2018: 1153 (2018) - 2017
- [j16]Ittai Abraham, Dahlia Malkhi:
The Blockchain Consensus Layer and BFT. Bull. EATCS 123 (2017) - [j15]Medhavi Dhawan, Gurprit Johal, Jim Stabile, Vjekoslav Brajkovic, James Chang, Kapil Goyal, Kevin James, Zeeshan Lokhandwala, Anny Martínez Manzanilla, Roger Michoud, Maithem Munshed, Srinivas Neginhal, Konstantin Spirov, Michael Wei, Scott Fritchie, Christopher J. Rossbach, Ittai Abraham, Dahlia Malkhi:
Consistent Clustered Applications with Corfu. ACM SIGOPS Oper. Syst. Rev. 51(1): 78-82 (2017) - [c68]Michael Wei, Amy Tai, Christopher J. Rossbach, Ittai Abraham, Maithem Munshed, Medhavi Dhawan, Jim Stabile, Udi Wieder, Scott Fritchie, Steven Swanson, Michael J. Freedman, Dahlia Malkhi:
vCorfu: A Cloud-Scale Object Store on a Shared Log. NSDI 2017: 35-49 - [c67]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 - [c66]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 - [c65]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. SODA 2017: 440-452 - [c64]Pandian Raju, Rohan Kadekodi, Vijay Chidambaram, Ittai Abraham:
PebblesDB: Building Key-Value Stores using Fragmented Log-Structured Merge Trees. SOSP 2017: 497-514 - [c63]Ittai Abraham, Srinivas Devadas, Kartik Nayak, Ling Ren:
Brief Announcement: Practical Synchronous Byzantine Consensus. DISC 2017: 41:1-41:4 - [i22]Ling Ren, Kartik Nayak, Ittai Abraham, Srinivas Devadas:
Practical Synchronous Byzantine Consensus. CoRR abs/1704.02397 (2017) - [i21]Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, Ofer Neiman:
Ramsey Spanning Trees and their Applications. CoRR abs/1707.08769 (2017) - [i20]Ittai Abraham, Arnold Filtser, Anupam Gupta, Ofer Neiman:
Metric Embedding via Shortest Path Decompositions. CoRR abs/1708.04073 (2017) - [i19]Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Ramakrishna Kotla, Jean-Philippe Martin:
Revisiting Fast Practical Byzantine Fault Tolerance. CoRR abs/1712.01367 (2017) - [i18]Ling Ren, Kartik Nayak, Ittai Abraham, Srinivas Devadas:
Practical Synchronous Byzantine Consensus. IACR Cryptol. ePrint Arch. 2017: 307 (2017) - [i17]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
- [j14]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck:
Highway Dimension and Provably Efficient Shortest Path Algorithms. J. ACM 63(5): 41:1-41:26 (2016) - [j13]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension. ACM Trans. Algorithms 12(2): 22:1-22:17 (2016) - [c62]Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng:
On Fully Dynamic Graph Sparsifiers. FOCS 2016: 335-344 - [c61]Michael Wei, Christopher J. Rossbach, Ittai Abraham, Udi Wieder, Steven Swanson, Dahlia Malkhi, Amy Tai:
Silver: A Scalable, Distributed, Multi-versioning, Always Growing (Ag) File System. HotStorage 2016 - [c60]Bryce W. Cronkite-Ratcliff, Aran Bergman, Shay Vargaftik, Madhusudhan Ravi, Nick McKeown, Ittai Abraham, Isaac Keslassy:
Virtualized Congestion Control. SIGCOMM 2016: 230-243 - [c59]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Rajesh Patel, Steven Shelford, Aleksandrs Slivkins:
How Many Workers to Ask?: Adaptive Exploration for Collecting High Quality Labels. SIGIR 2016: 473-482 - [c58]Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. SODA 2016: 740-753 - [c57]Amy Tai, Michael Wei, Michael J. Freedman, Ittai Abraham, Dahlia Malkhi:
Replex: A Scalable, Highly Available Multi-Index Data Store. USENIX ATC 2016: 337-350 - [r1]Ittai Abraham, Ofer Neiman:
Spanning Trees with Low Average Stretch. Encyclopedia of Algorithms 2016: 2032-2035 - [i16]Ittai Abraham, David Durfee, Ioannis Koutis, Sebastian Krinninger, Richard Peng:
On Fully Dynamic Graph Sparsifiers. CoRR abs/1604.02094 (2016) - [i15]Ittai Abraham, Shiri Chechik, Sebastian Krinninger:
Fully dynamic all-pairs shortest paths with worst-case update-time revisited. CoRR abs/1607.05132 (2016) - [i14]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) - [i13]Kartik Nayak, Ling Ren, Ittai Abraham, Benny Pinkas:
An Oblivious RAM with Sub-logarithmic Bandwidth Blowup. IACR Cryptol. ePrint Arch. 2016: 849 (2016) - 2015
- [j12]Ittai Abraham, Yair Bartal, Ofer Neiman:
Local Embeddings of Metric Spaces. Algorithmica 72(2): 539-606 (2015) - [j11]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. SIAM J. Comput. 44(1): 160-192 (2015) - [j10]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network. SIAM J. Comput. 44(3): 617-668 (2015) - [c56]Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder:
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. APPROX-RANDOM 2015: 20-42 - [c55]Ittai Abraham, Danny Dolev:
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity. STOC 2015: 605-614 - [i12]Ittai Abraham, Danny Dolev:
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity. CoRR abs/1504.02547 (2015) - 2014
- [j9]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. Discret. Comput. Geom. 52(2): 366-389 (2014) - [c54]Ittai Abraham, Shiri Chechik, Kunal Talwar:
Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier. APPROX-RANDOM 2014: 1-16 - [c53]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Rajesh Patel, Steven Shelford, Aleksandrs Slivkins:
Using Worker Quality Scores to Improve Stopping Rules. HCOMP 2014: 2-3 - [c52]Ittai Abraham, Shiri Chechik:
Distance Labels with Optimal Local Stretch. ICALP (1) 2014: 52-63 - [c51]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs. STOC 2014: 79-88 - [i11]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Rajesh Patel, Steven Shelford, Aleksandrs Slivkins:
Using Worker Quality Scores to Improve Stopping Rules. CoRR abs/1411.0149 (2014) - 2013
- [j8]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato F. Werneck:
Alternative routes in road networks. ACM J. Exp. Algorithmics 18 (2013) - [c50]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins:
Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem. COLT 2013: 882-910 - [c49]Ittai Abraham, Susan Athey, Moshe Babaioff, Michael Grubb:
Peaches, lemons, and cookies: designing auction markets with dispersed information. EC 2013: 7-8 - [c48]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-distortion Inference of Latent Similarities from a Multiplex Social Network. SODA 2013: 1853-1872 - [c47]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Distributed Protocols for Leader Election: A Game-Theoretic Perspective. DISC 2013: 61-75 - [i10]Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins:
Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem. CoRR abs/1302.3268 (2013) - [i9]Ittai Abraham, Shiri Chechik:
Dynamic Decremental Approximate Distance Oracles with (1+ε, 2) stretch. CoRR abs/1307.1516 (2013) - [i8]Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, Kunal Talwar:
Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs. CoRR abs/1311.3048 (2013) - 2012
- [c46]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Hierarchical Hub Labelings for Shortest Paths. ESA 2012: 24-35 - [c45]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
HLDB: location-based services in databases. SIGSPATIAL/GIS 2012: 339-348 - [c44]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial auctions with restricted complements. EC 2012: 3-16 - [c43]Ittai Abraham, Ofer Neiman:
Using petal-decompositions to build a low stretch spanning tree. STOC 2012: 395-406 - [c42]Ittai Abraham, Shiri Chechik, Cyril Gavoille:
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. STOC 2012: 1199-1218 - [i7]Ittai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins:
Low-distortion Inference of Latent Similarities from a Multiplex Social Network. CoRR abs/1202.0922 (2012) - [i6]Ittai Abraham, Moshe Babaioff, Shaddin Dughmi, Tim Roughgarden:
Combinatorial Auctions with Restricted Complements. CoRR abs/1205.4104 (2012) - 2011
- [j7]Ittai Abraham, Lorenzo Alvisi, Joseph Y. Halpern:
Distributed computing meets game theory: combining insights from two fields. SIGACT News 42(2): 69-76 (2011) - [c41]Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
VC-Dimension and Shortest Path Algorithms. ICALP (1) 2011: 690-699 - [c40]Ittai Abraham, Cyril Gavoille:
On Approximate Distance Labels and Routing Schemes with Affine Stretch. DISC 2011: 404-415 - [c39]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. SEA 2011: 230-241 - 2010
- [j6]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-Diameter Decompositions of Minor Free Graphs. Theory Comput. Syst. 47(4): 837-855 (2010) - [c38]Ittai Abraham, Yair Bartal, Ofer Neiman, Leonard J. Schulman:
Volume in General Metric Spaces. ESA (2) 2010: 87-99 - [c37]Ittai Abraham, Shiri Chechik, Cyril Gavoille, David Peleg:
Forbidden-set distance labels for graphs of bounded doubling dimension. PODC 2010: 192-200 - [c36]Ittai Abraham, Amos Fiat, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. SODA 2010: 782-793 - [c35]Ittai Abraham, Marcos Kawazoe Aguilera, Dahlia Malkhi:
Fast Asynchronous Consensus with Optimal Resilience. DISC 2010: 4-19 - [c34]Ittai Abraham, Daniel Delling, Andrew V. Goldberg, Renato Fonseca F. Werneck:
Alternative Routes in Road Networks. SEA 2010: 23-34
2000 – 2009
- 2009
- [b1]Ittai Abraham:
Locality and efficiency in distributed computing (עם תקציר בעברית ושער נוסף: יעילות ולוקאליות במערכות מבוזרות.). Hebrew University of Jerusalem, Israel, 2009 - [c33]Ittai Abraham, Yair Bartal, Ofer Neiman:
On low dimensional local embeddings. SODA 2009: 875-884 - [c32]Ittai Abraham, Dahlia Malkhi, David Ratajczak:
Compact Multicast Routing. DISC 2009: 364-378 - 2008
- [j5]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. ACM Trans. Algorithms 4(3): 37:1-37:12 (2008) - [c31]Ittai Abraham, Yair Bartal, Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees. FOCS 2008: 781-790 - [c30]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience. PODC 2008: 405-414 - [c29]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metric spaces in their intrinsic dimension. SODA 2008: 363-372 - [c28]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Lower Bounds on Implementing Robust and Resilient Mediators. TCC 2008: 302-319 - [i5]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. CoRR abs/0808.1505 (2008) - [i4]Ittai Abraham, Yair Bartal, Ofer Neiman:
Nearly Tight Low Stretch Spanning Trees. CoRR abs/0808.2017 (2008) - 2007
- [j4]Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Wait-free regular storage from Byzantine components. Inf. Process. Lett. 101(2): 60-65 (2007) - [c27]Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Venugopalan Ramasubramanian, Kunal Talwar:
Reconstructing approximate tree metrics. PODC 2007: 43-52 - [c26]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. SODA 2007: 502-511 - [c25]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Udi Wieder:
Strong-diameter decompositions of minor free graphs. SPAA 2007: 16-24 - [c24]Ittai Abraham, Yair Bartal, Ofer Neiman:
Local embeddings of metric spaces. STOC 2007: 631-640 - [i3]Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Lower Bounds on Implementing Robust and Resilient Mediators. CoRR abs/0704.3646 (2007) - 2006
- [j3]Ittai Abraham, Danny Dolev:
Asynchronous resource discovery. Comput. Networks 50(10): 1616-1629 (2006) - [j2]Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Byzantine disk paxos: optimal resilience with byzantine shared memory. Distributed Comput. 18(5): 387-408 (2006) - [c23]Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, Dahlia Malkhi:
Routing in Networks with Low Doubling Dimension. ICDCS 2006: 75 - [c22]Ittai Abraham, Danny Dolev, Rica Gonen, Joseph Y. Halpern:
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. PODC 2006: 53-62 - [c21]Ittai Abraham, Cyril Gavoille:
Object location using path separators. PODC 2006: 188-197 - [c20]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
On space-stretch trade-offs: lower bounds. SPAA 2006: 207-216 - [c19]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
On space-stretch trade-offs: upper bounds. SPAA 2006: 217-224 - [c18]Ittai Abraham, Yair Bartal, Ofer Neiman:
Advances in metric embedding theory. STOC 2006: 271-286 - [i2]Ittai Abraham, Yair Bartal, Ofer Neiman:
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion. CoRR abs/cs/0610003 (2006) - 2005
- [j1]Ittai Abraham, Dahlia Malkhi:
Probabilistic quorums for dynamic systems. Distributed Comput. 18(2): 113-124 (2005) - [c17]Ittai Abraham, Dahlia Malkhi:
Robust Locality-Aware Lookup Networks. Self-star Properties in Complex Information Systems 2005: 392-402 - [c16]Ittai Abraham, Yair Bartal, T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, Aleksandrs Slivkins:
Metric Embeddings with Relaxed Guarantees. FOCS 2005: 83-100 - [c15]Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, Saar Ron:
Practical Locality-Awareness for Large Scale Information Sharing. IPTPS 2005: 173-181 - [c14]Ittai Abraham, James Aspnes, Jian Yuan:
Skip B-Trees. OPODIS 2005: 366-380 - [c13]Ittai Abraham, Dahlia Malkhi:
Name independent routing for growth bounded networks. SPAA 2005: 49-55 - [c12]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Compact Routing for Graphs Excluding a Fixed Minor. DISC 2005: 442-456 - [c11]Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku:
Papillon: Greedy Routing in Rings. DISC 2005: 514-515 - [i1]Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku:
Papillon: Greedy Routing in Rings. CoRR abs/cs/0507034 (2005) - 2004
- [c10]Ittai Abraham, Danny Dolev, Dahlia Malkhi:
LLS: a locality aware location service for mobile ad hoc networks. DIALM-POMC 2004: 75-84 - [c9]Ittai Abraham, Yonatan Amit, Danny Dolev:
Optimal Resilience Asynchronous Approximate Agreement. OPODIS 2004: 229-239 - [c8]Ittai Abraham, Dahlia Malkhi:
Compact routing on euclidian metrics. PODC 2004: 141-149 - [c7]Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Byzantine disk paxos: optimal resilience with byzantine shared memory. PODC 2004: 226-235 - [c6]Ittai Abraham, Dahlia Malkhi, Oren Dobzinski:
LAND: stretch (1 + epsilon) locality-aware networks for DHTs. SODA 2004: 550-559 - [c5]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup:
Compact name-independent routing with minimum stretch. SPAA 2004: 20-24 - [c4]Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Routing with Improved Communication-Space Trade-Off. DISC 2004: 305-319 - 2003
- [c3]Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov:
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. IPDPS 2003: 40 - [c2]Ittai Abraham, Danny Dolev:
Asynchronous resource discovery. PODC 2003: 143-150 - [c1]Ittai Abraham, Dahlia Malkhi:
Probabilistic Quorums for Dynamic Systems. DISC 2003: 60-74
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-12-23 19:31 CET 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:
