Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Negar Kiyavash
2010 – today
- 2013
[j8]Negar Kiyavash, Farinaz Koushanfar, Todd P. Coleman, Mavis Rodrigues: A Timing Channel Spyware for the CSMA/CA Protocol. IEEE Transactions on Information Forensics and Security 8(3): 477-487 (2013)
[j7]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus: Fingerprinting With Equiangular Tight Frames. IEEE Transactions on Information Theory 59(3): 1855-1865 (2013)
[j6]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman: Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs. IEEE Transactions on Signal Processing 61(12): 3173-3182 (2013)
[i13]Xun Gong, Mavis Rodrigues, Negar Kiyavash: Invisible Flow Watermarks for Channels with Dependent Substitution, Deletion, and Bursty Insertion Errors. CoRR abs/1302.5734 (2013)
[i12]Sachin Kadloor, Negar Kiyavash, Parv Venkitasubramaniam: Mitigating Timing Side Channel in Shared Schedulers. CoRR abs/1302.6123 (2013)
[i11]Daniel Cullina, Negar Kiyavash: An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes. CoRR abs/1302.6562 (2013)- 2012
[j5]Siva K. Gorantla, Sachin Kadloor, Negar Kiyavash, Todd P. Coleman, Ira S. Moskowitz, Myong H. Kang: Characterizing the Efficacy of the NRL Network Pump in Mitigating Covert Timing Channels. IEEE Transactions on Information Forensics and Security 7(1): 64-75 (2012)
[j4]Sachin Kadloor, Xun Gong, Negar Kiyavash, Parv Venkitasubramaniam: Designing Router Scheduling Policies: A Privacy Perspective. IEEE Transactions on Signal Processing 60(4): 2001-2012 (2012)
[c26]Xun Gong, Mavis Rodrigues, Negar Kiyavash: Invisible flow watermarks for channels with dependent substitution and deletion errors. ICASSP 2012: 1773-1776
[c25]Sachin Kadloor, Negar Kiyavash, Parv Venkitasubramaniam: Mitigating timing based information leakage in shared schedulers. INFOCOM 2012: 1044-1052
[c24]Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash: A coloring approach to constructing deletion correcting codes from constant weight subgraphs. ISIT 2012: 513-517
[c23]Jalal Etesami, Negar Kiyavash, Todd P. Coleman: Learning minimal latent directed information trees. ISIT 2012: 2726-2730
[c22]Xun Gong, Nikita Borisov, Negar Kiyavash, Nabil Schear: Website Detection Using Remote Traffic Analysis. Privacy Enhancing Technologies 2012: 58-78
[i10]Negar Kiyavash, Amir Houmansadr, Nikita Borisov: Multi-Flow Attacks Against Network Flow Watermarks: Analysis and Countermeasures. CoRR abs/1203.1390 (2012)
[i9]Amir Houmansadr, Negar Kiyavash, Nikita Borisov: Non-blind watermarking of network flows. CoRR abs/1203.2273 (2012)
[i8]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman: Directed Information Graphs. CoRR abs/1204.2003 (2012)
[i7]Ankur A. Kulkarni, Negar Kiyavash: Non-asymptotic Upper Bounds for Deletion Correcting Codes. CoRR abs/1211.3128 (2012)
[i6]Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash: Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings. CoRR abs/1211.4056 (2012)- 2011
[j3]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash, Nicholas G. Hatsopoulos: Estimating the directed information to infer causal relationships in ensemble neural spike train recordings. Journal of Computational Neuroscience 30(1): 17-44 (2011)
[c21]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman: A minimal approach to causal inference on topologies with bounded indegree. CDC-ECE 2011: 168-173
[c20]Anh Truong, Negar Kiyavash, Vivek Borkar: Convergence analysis for an online recommendation system. CDC-ECE 2011: 3889-3894
[c19]Sachin Kadloor, Xun Gong, Negar Kiyavash, Parv Venkitasubramaniam: Designing privacy preserving router scheduling policies. CISS 2011: 1-6
[c18]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus: Equiangular tight frame fingerprinting codes. ICASSP 2011: 1856-1859
[c17]Christopher J. Quinn, Negar Kiyavash, Todd P. Coleman: Equivalence between minimal generative model graphs and directed information graphs. ISIT 2011: 293-297
[c16]Xun Gong, Negar Kiyavash, Parv Venkitasubramaniam: Information theoretic analysis of side channel information leakage in FCFS schedulers. ISIT 2011: 1255-1259
[i5]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash: Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes. CoRR abs/1101.5108 (2011)
[i4]Xun Gong, Negar Kiyavash, Nabil Schear, Nikita Borisov: Website Detection Using Remote Traffic Analysis. CoRR abs/1109.0097 (2011)
[i3]Dustin G. Mixon, Christopher J. Quinn, Negar Kiyavash, Matthew Fickus: Fingerprinting with Equiangular Tight Frames. CoRR abs/1111.3376 (2011)- 2010
[c15]Xun Gong, Negar Kiyavash, Nikita Borisov: Fingerprinting websites using remote traffic analysis. ACM Conference on Computer and Communications Security 2010: 684-686
[c14]Sachin Kadloor, Xun Gong, Negar Kiyavash, Parv Venkitasubramaniam: Designing router scheduling policies: a privacy perspective. ACM Conference on Computer and Communications Security 2010: 702-704
[c13]Sachin Kadloor, Xun Gong, Negar Kiyavash, T. Tezcan, Nikita Borisov: Low-Cost Side Channel Remote Traffic Analysis Attack in Packet Networks. ICC 2010: 1-5
[c12]Christopher J. Quinn, Todd P. Coleman, Negar Kiyavash: Approximating discrete probability distributions with causal dependence trees. ISITA 2010: 100-105
[c11]Siva K. Gorantla, Sachin Kadloor, Todd P. Coleman, Negar Kiyavash, Ira S. Moskowitz, Myong H. Kang: Directed information and the NRL Network Pump. ISITA 2010: 343-348
2000 – 2009
- 2009
[j2]Negar Kiyavash, Pierre Moulin: Performance of orthogonal fingerprinting codes under worst-case noise. IEEE Transactions on Information Forensics and Security 4(3): 293-301 (2009)
[j1]Negar Kiyavash, Pierre Moulin, Ton Kalker: Regular simplex fingerprints and their optimality properties. IEEE Transactions on Information Forensics and Security 4(3): 318-329 (2009)
[c10]Negar Kiyavash, Todd P. Coleman: Covert timing channels codes for communication over interactive traffic. ICASSP 2009: 1485-1488
[c9]Amir Houmansadr, Negar Kiyavash, Nikita Borisov: Multi-flow attack resistant watermarks for network flows. ICASSP 2009: 1497-1500
[c8]Negar Kiyavash, Todd P. Coleman, Mavis Rodrigues: Novel Shaping and Complexity-Reduction Techniques for Approaching Capacity over Queuing Timing Channels. ICC 2009: 1-5
[c7]Amir Houmansadr, Negar Kiyavash, Nikita Borisov: RAINBOW: A Robust And Invisible Non-Blind Watermark for Network Flows. NDSS 2009- 2008
[c6]Todd P. Coleman, Negar Kiyavash: Sparse graph codes and practical decoding algorithms for communicating over packet timings in networks. CISS 2008: 447-452
[c5]Todd P. Coleman, Negar Kiyavash, Vijay G. Subramanian: The Rate-Distortion Function of a Poisson Process with a Queueing Distortion Measure. DCC 2008: 63-72
[c4]Yousra Alkabani, Farinaz Koushanfar, Negar Kiyavash, Miodrag Potkonjak: Trusted Integrated Circuits: A Nondestructive Hidden Characteristics Extraction Approach. Information Hiding 2008: 102-117
[c3]Negar Kiyavash, Amir Houmansadr, Nikita Borisov: Multi-flow Attacks Against Network Flow Watermarking Schemes. USENIX Security Symposium 2008: 307-320- 2007
[c2]Negar Kiyavash, Farinaz Koushanfar: Anti-Collusion Position Estimation in Wireless Sensor Networks. MASS 2007: 1-9- 2005
[c1]Negar Kiyavash, Pierre Moulin: Regular Simplex Fingerprints and Their Optimality Properties. IWDW 2005: 97-109
[i2]Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash, Jason Teutsch, Dejan Vukobratovic: On the Minimal Pseudo-Codewords of Codes from Finite Geometries. CoRR abs/cs/0508019 (2005)
[i1]Iwan M. Duursma, Negar Kiyavash: The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves. IACR Cryptology ePrint Archive 2005: 31 (2005)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-28 21:36 CEST by the dblp team



