Ari Trachtenberg

Affiliations:
  • Boston University, USA


According to our database1, Ari Trachtenberg authored at least 76 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Enabling Cost-Benefit Analysis of Data Sync Protocols.
Computer, October, 2023

SREP: Out-Of-Band Sync of Transaction Pools for Large-Scale Blockchains.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

2022
Empirical Comparison of Block Relay Protocols.
IEEE Trans. Netw. Serv. Manag., December, 2022

GenSync: A New Framework for Benchmarking and Optimizing Reconciliation of Data.
IEEE Trans. Netw. Serv. Manag., December, 2022

Union Buster: A Cross-Container Covert-Channel Exploiting Union Mounting.
Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021
Churn in the Bitcoin Network.
IEEE Trans. Netw. Serv. Manag., 2021

Investigating Orphan Transactions in the Bitcoin Network.
IEEE Trans. Netw. Serv. Manag., 2021

2020
Privacy-Preserving Automated Exposure Notification.
IACR Cryptol. ePrint Arch., 2020

Anonymous Collocation Discovery: Taming the Coronavirus While Preserving Privacy.
CoRR, 2020

Characterizing Orphan Transactions in the Bitcoin Network.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2020

Birdwatching: False Negatives In Cuckoo Filters.
Proceedings of the CoNEXT'20: Proceedings of the Student Workshop, Barcelona, 2020

2019
Alternative (ab)uses for HTTP Alternative Services.
Proceedings of the 13th USENIX Workshop on Offensive Technologies, 2019

Case Study: Disclosure of Indirect Device Fingerprinting in Privacy Policies.
Proceedings of the Socio-Technical Aspects in Security and Trust, 2019

Churn in the Bitcoin Network: Characterization and Impact.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2019

Location Leakage from Network Access Patterns.
Proceedings of the 7th IEEE Conference on Communications and Network Security, 2019

Page Cache Attacks.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

Scalable String Reconciliation by Recursive Content-Dependent Shingling.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Collaborative Privacy for Web Applications.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Nothing But Net: Invading Android User Privacy Using Only Network Access Patterns.
CoRR, 2018

Improving Bitcoin's Resilience to Churn.
CoRR, 2018

Empirical Kolmogorov Complexity.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Distributed Web Mining of Ethereum.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2018

Cashing in on the File-System Cache.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2016
Fountain Codes With Nonuniform Selection Distributions Through Feedback.
IEEE Trans. Inf. Theory, 2016

Channel Sensitivity of LIFO-Backpressure: Quirks and Improvements.
IEEE Trans. Control. Netw. Syst., 2016

SoK: Privacy on Mobile Devices - It's Complicated.
Proc. Priv. Enhancing Technol., 2016

2015
TeaCP: A Toolkit for Evaluation and Analysis of Collection Protocols in Wireless Sensor Networks.
IEEE Trans. Netw. Serv. Manag., 2015

CDP: a coded datagram transport protocol bridging UDP and TCP.
Proceedings of the 8th ACM International Systems and Storage Conference, 2015

2014
Securing Smartphones: A µTCB Approach.
IEEE Pervasive Comput., 2014

Deciding unique decodability of bigram counts via finite automata.
J. Comput. Syst. Sci., 2014

Securing Smartphones: A Micro-TCB Approach.
CoRR, 2014

Intra-car multihop wireless sensor networking: a case study.
IEEE Commun. Mag., 2014

Near real-time rateless coding with a constrained feedback budget.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
An Overview of the Capabilities and Limitations of Smartphone Sensors.
Int. J. Handheld Comput. Res., 2013

Intra-Car Wireless Sensors Data Collection: A Multi-Hop Approach.
Proceedings of the 77th IEEE Vehicular Technology Conference, 2013

Determining the unique decodability of a string in linear time.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Efficient determination of the unique decodability of a string.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Delete-and-Conquer: Rateless coding with constrained feedback.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Reliable rateless wireless broadcasting with near-zero feedback.
IEEE/ACM Trans. Netw., 2012

Connected Identifying Codes.
IEEE Trans. Inf. Theory, 2012

Efficiently decoding strings from their shingles
CoRR, 2012

Prioritized data synchronization for disruption tolerant networks.
Proceedings of the 31st IEEE Military Communications Conference, 2012

String reconciliation with unknown edit distance.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Scheduling algorithms and bounds for rateless data dissemination in dense wireless networks.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

2011
Unique decodability of bigram counts by finite automata
CoRR, 2011

Connected identifying codes for sensor network monitoring.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

Phones and robots: brains and brawn.
Proceedings of the 9th International Conference on Embedded Networked Sensor Systems, 2011

Poster: gait-based smartphone user identification.
Proceedings of the 9th International Conference on Mobile Systems, 2011

Connecting identifying codes and fundamental bounds.
Proceedings of the Information Theory and Applications Workshop, 2011

2010
Reliable Wireless Broadcasting with Near-Zero Feedback.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Joint Monitoring and Routing in Wireless Sensor Networks Using Robust Identifying Codes.
Mob. Networks Appl., 2009

Fair and distributed peer-to-peer allocation of a common, refillable resource.
J. Parallel Distributed Comput., 2009

Rateless Coding with Feedback.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Identifying Codes and Covering Problems.
IEEE Trans. Inf. Theory, 2008

Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks Using Random Linear Codes.
Proceedings of the 7th International Conference on Information Processing in Sensor Networks, 2008

2007
Near Optimal Update-Broadcast of Data Sets.
Proceedings of the 8th International Conference on Mobile Data Management (MDM 2007), 2007

Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Bandwidth Efficient String Reconciliation Using Puzzles.
IEEE Trans. Parallel Distributed Syst., 2006

Rateless codes for data dissemination in sensor networks.
Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, 2006

Approximating the number of differences between remote sets.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Fast data access over asymmetric channels using fair and secure bandwidth sharing.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005
Disjoint identifying-codes for arbitrary graphs.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Robust location detection with sensor networks.
IEEE J. Sel. Areas Commun., 2004

An Implementation of Indoor Location Detection Systems Based on Identifying Codes.
Proceedings of the Intelligence in Communication Systems, IFIP International Conference, 2004

Reconciliation puzzles [separately hosted strings reconciliation].
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Efficient PDA Synchronization.
IEEE Trans. Mob. Comput., 2003

Set reconciliation with nearly optimal communication complexity.
IEEE Trans. Inf. Theory, 2003

Data verification and reconciliation with generalized error-control cod.
IEEE Trans. Inf. Theory, 2003

Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist.
SIAM J. Discret. Math., 2003

Robust Location Detection in Emergency Sensor Networks.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Designing lexicographic codes with a given trellis complexity.
IEEE Trans. Inf. Theory, 2002

On the scalability of data synchronization protocols for PDAs and mobile devices.
IEEE Netw., 2002

Fast network synchronization.
Comput. Commun. Rev., 2002

Fast PDA Synchronization Using Characteristic Polynomial Interpolation.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2000
Error -Correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs
PhD thesis, 2000

1999
Which codes have cycle-free Tanner graphs?
IEEE Trans. Inf. Theory, 1999


  Loading...