| |
| Hal Abelson
| Information Accountability
|
| |
| David Ackley
| Randomized Instruction Set Emulation
|
| |
| David Ackley
| Computation in the Wild
|
| |
| Elena S. Ackley
| On-line Negative Databases
|
| |
| Elena S. Ackley
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Elena Ackley
| Protecting Data Privacy through Hard-to-Reverse Negative Databases
|
| |
| Elena S. Ackley
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Rakesh Agarwala
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| Rakesh Agarwala
| Anabaptist Genealogy Database
|
| |
| Gagan Aggarwal
| Approximation Algorithms for k-Anonymity
|
| Gagan Aggarwal
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| Gagan Aggarwal
| Anonymizing Tables
|
| Gagan Aggarwal
| k-Anonymity: Algorithms and Hardness
|
| |
| Gagan Aggarwal
| Privacy Protection and Advertising in a Networked World.
|
| |
| Gagan Aggarwal
| Achieving Anonymity via Clustering
|
| |
| Gagan Aggarwal
| Algorithms for the Database Layout Problem
|
| Gagan Aggarwal
| On the Streaming Model Augmented with a Sorting Primitive
|
| Gagan Aggarwal
| Enabling Privacy for the Paranoids
|
| Gagan Aggarwal
| Secure computation of the k'th-ranked element
|
| |
| G. Aggrawal
| An analysis of private browsing modes in modern browsers
|
| |
| Rakesh Agrawal
| Privacy Preserving Indexing of Documents on the Network
|
| |
| Rakesh Agrawal
| Privacy Preserving OLAP
|
| |
| Noga Alon
| Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
|
| |
| Dana Angluin
| Stabilizing Consensus in Mobile Networks
|
| Dana Angluin
| Stably computable properties of network graphs
|
| |
| Dana Angluin
| Self-stabilizing behavior in networks of nondeterministically
interacting sensors
|
| |
| A Arasu
| Approximate Counts and Quantiles over Sliding Windows
|
| |
| David Arthur
| Analyzing the Efficiency of BitTorrent and Related
Peer-to-Peer Networks
|
| |
| James Aspnes
| Stably computable properties of network graphs
|
| |
| James Aspnes
| Towards a Theory of Data Entanglement
|
| James Aspnes
| Self-stabilizing behavior in networks of nondeterministically
interacting sensors
|
| James Aspnes
| Inoculation strategies for victims of viruses and the sum-of-squares partition problem
|
| |
| David Athur
| On the Worst Case Complexity of the k-means Method
|
| |
| Brian Babcock
| Load Shedding Techniques for Aggregation Queries in Stream Systems
|
| Brian Babcock
| Operator scheduling in data stream systems
|
| |
| Shivnath Babu
| The Pipelined Set Cover Problem
|
| Shivnath Babu
| Adaptive Caching for Continuous Queries
|
| |
| Shivnath Babu
| Adaptive Ordering of Pipelined Stream Filters
|
| Shivnath Babu
| Operator scheduling in data stream systems
|
| |
| Michael Backes
| Compositional Analysis of Contract Signing Protocols
|
| |
| Justin Balthrop
| Computation in the Wild
|
| Justin Balthrop
| Technological Networks and the Spread of Computer Viruses
|
| |
| S. Barocas
| Privacy preserving targeted advertising
|
| |
| G. Barrantes
| Randomized Instruction Set Emulation
|
| |
| G. Barrantes
| Increasing Communications Security through Protocol Parameter Diversity
|
| |
| Paulo S.L.M. Barreto
| Efficient Implementation of Pairing-Based Cryptosystems
|
| Paulo S.L.M. Barreto
| On the Selection of Pairing-Friendly Groups
|
| |
| Paulo S.L.M. BarretoM
| Constructing Elliptic Curves with Prescribed Embedding Degrees
|
| |
| Adam Barth
| Privacy and Contextual Integrity: Framework and
Applications
|
| Adam Barth
| Managing Digital Rights using Linear Logic
|
| |
| Adam Barth
| Enterprise Privacy Promises and Enforcement
|
| Adam Barth
| Correcting Privacy Violations in Blind-Carbon-Copy (BCC)
Encrypted Email
|
| Adam Barth
| Conflict and Combination in Privacy Policy Languages
|
| |
| Adam Barth
| Private encrypted content distribution using private broadcast
encryption
|
| |
| Mayank Bawa
| Enabling Privacy for the Paranoids
|
| Mayank Bawa
| The Price of Validity in Dynamic Networks
|
| Mayank Bawa
| Privacy Preserving Indexing of Documents on the Network
|
| |
| Mayank Bawa
| Query Processing With Guarantees in Query-Centric
Networks
|
| |
| Mayank Bawa
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| |
| M. Bayati
| Achieving Stability in Networks of Input-Queued Switches
using a Local Online Scheduling Algorithm
|
| |
| Omar Benjelloun
| Swoosh: A Generic Approach to Entity Resolution
|
| Omar Benjelloun
| Generic Entity Resolution with Data Confidences
|
| |
| Omar Benjelloun
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| Omar Benjelloun
| Generic Entity Resolution with Data Confidences
|
| |
| Dirk Bergemann
| Flexibility as an Instrument in DRM Systems
|
| |
| Dirk Bergemann
| Towards an Economic Analysis of Trusted Systems (Position Paper)
|
| |
| Tim Berners-Lee
| Information Accountability
|
| |
| LG Biesecker
| Anabaptist Genealogy Database
|
| |
| Philip Bohannon
| Detection and Recovery Techniques for Database Corruption
|
| |
| H. Bojinov
| Kamouflage: loss-resistant password management
|
| H. Bojinov
| XCS: cross channel scripting and its impact on web applications
|
| |
| Rebecca Bolin
| Policy Responses to Spam
|
| |
| D. Boneh
| Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks
|
| D. Boneh
| An analysis of private browsing modes in modern browsers
|
| |
| D. Boneh
| Privacy preserving targeted advertising
|
| D. Boneh
| Kamouflage: loss-resistant password management
|
| D. Boneh
| Busting frame busting: a study of clickjacking vulnerabilities at popular sites
|
| D. Boneh
| XCS: cross channel scripting and its impact on web applications
|
| D. Boneh
| Traitor Tracing with Constant Size Ciphertext
|
| D. Boneh
| On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
|
| D. Boneh
| Conjunctive, subset, and range queries on encrypted data
|
| D. Boneh
| Exposing private information by timing web applications
|
| D. Boneh
| Reducing Shoulder-surfing by Using Gaze-based Password Entry
|
| D. Boneh
| Transaction Generators: Root Kits for the Web
|
| D. Boneh
| Space-Efficient Identity Based Encryption Without Pairings
|
| |
| Dan Boneh
| Short Signatures from the Weil Pairing
|
| Dan Boneh
| Aggregate and Verifiably Encrytped Signatures from Bilinear
Maps
|
| |
| Dan Boneh
| Private encrypted content distribution using private broadcast
encryption
|
| Dan Boneh
| Hierarchical Identity Based Encryption with Constant Size
Ciphertext
|
| Dan Boneh
| Stronger Password Authentication Using
Browser Extensions
|
| Dan Boneh
| Applications of Multilinear Forms to Cryptography
|
| |
| Dan Boneh
| Private Web Search
|
| |
| Dan Boneh
| Protecting Browser State from Web Privacy Attacks
|
| Dan Boneh
| Correcting Privacy Violations in Blind-Carbon-Copy (BCC)
Encrypted Email
|
| Dan Boneh
| Short Group Signatures
|
| Dan Boneh
| Searchable Public Key Encryption
|
| Dan Boneh
| PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment
|
| Dan Boneh
| A Survey of Two Signature Aggregation Techniques
|
| Dan Boneh
| Oblivious Signature-Based Envelope
|
| |
| Dan Boneh
| A Browser Plug-in Solution to the Unique Password Problem
|
| Dan Boneh
| Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
|
| Dan Boneh
| Evaluating 2-DNF Formulas on Ciphertexts
|
| Dan Boneh
| Group Signatures with Verifier-Local Revocation
|
| |
| Dan Boneh
| On the Effectiveness of Address-Space Randomization
|
| |
| A. Bortz
| Exposing private information by timing web applications
|
| |
| Andrew Bortz
| Protecting Browser State from Web Privacy Attacks
|
| |
| X. Boyen
| Kamouflage: loss-resistant password management
|
| |
| Xavier Boyen
| Hierarchical Identity Based Encryption with Constant Size
Ciphertext
|
| |
| Xavier Boyen
| Direct Chosen Ciphertext Security from Identity-Based Techniques
|
| Xavier Boyen
| Short Group Signatures
|
| |
| James Brown
| Scaling Theory for Information Networks
|
| |
| Dave Buchfuhrer
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| David Buchfuhrer
| Computation and incentives in combinatorial public projects
|
| |
| John Burge
| Learning DFA representations of HTTP for protecting web
applications
|
| |
| Mike Burmester
| Accountable Privacy
|
| |
| E. Bursztein
| Kamouflage: loss-resistant password management
|
| E. Bursztein
| Busting frame busting: a study of clickjacking vulnerabilities at popular sites
|
| E. Bursztein
| XCS: cross channel scripting and its impact on web applications
|
| |
| E. Bursztein
| Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks
|
| E. Bursztein
| An analysis of private browsing modes in modern browsers
|
| |
| Ran Canetti
| Extractable Perfectly One-way Functions
|
| |
| Ran Canetti
| Obfuscating Point Functions with Multibit Output
|
| |
| Ran Canetti
| Towards a Theory of Extractable Functions
|
| |
| Melody Chan
| Stably computable properties of network graphs
|
| |
| Kevin Chang
| Inoculation strategies for victims of viruses and the sum-of-squares partition problem
|
| |
| Kevin Chang
|
Pass-Efficient Algorithms for Clustering
|
| |
| Kevin Chang
| Pass-Efficient Algorithms for Facility Location
|
| Kevin Chang
| The Space Complexity of Pass-Efficient Algorithms for Clustering
|
| |
| S. Chaudhuri
| Robust identification of fuzzy duplicates
|
| |
| Shuchi Chawla
| Toward Privacy in Public Databases
|
| |
| David Cheng
| A Divide-and-Merge Methodology for Clustering
|
| |
| Neil Chou
| Client-side defense against web-based identity theft
|
| |
| John Corwin
| Dynamic Tables: An Architecture for Managing Evolving, Heterogeneous Biomedical Data in Relational Database Management Systems
|
| |
| Giovanni Di Crescenzo
| Searchable Public Key Encryption
|
| |
| Judy Cushing
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Ronny Ramzi Dakdouk
| Theory and Application of Extractable Functions
|
| |
| Ronny Ramzi Dakdouk
| Extractable Perfectly One-way Functions
|
| |
| Ronny Ramzi Dakdouk
| Obfuscating Point Functions with Multibit Output
|
| |
| Ronny Ramzi Dakdouk
| Towards a Theory of Extractable Functions
|
| |
| Anirban Dasgupta
| Spectral Clustering by Recursive Partitioning
|
| |
| Anirban Dasgupta
| Spectral Clustering with Limited Independence
|
| |
| Mayur Datar
| On the Streaming Model Augmented with a Sorting Primitive
|
| Mayur Datar
| Load Shedding Techniques for Aggregation Queries in Stream Systems
|
| Mayur Datar
| Operator scheduling in data stream systems
|
| |
| Anupam Datta
| Security Analysis of Network Protocols: Compositional Reasoning and
Complexity-theoretic Foundations
|
| |
| Anupam Datta
| Privacy and Contextual Integrity: Framework and
Applications
|
| |
| Anupam Datta
| Probabilistic polynomial-time semantics for a protocol security
logic
|
| Anupam Datta
| The Impossibility of Realizable Ideal Functionality
|
| Anupam Datta
| Compositional Analysis of Contract Signing Protocols
|
| Anupam Datta
| A Modular Correctness Proof of IEEE 802.11i and TLS
|
| Anupam Datta
| A derivation system and compositional logic for security
protocols
|
| Anupam Datta
| Sequential Probabilistic Process Calculus and Simulation-Based
Security
|
| Anupam Datta
| Unifying Equivalence-Based Definitions of Protocol Security
|
| Anupam Datta
| Abstraction and Refinement in Protocol Derivation
|
| Anupam Datta
| Secure Protocol Composition
|
| Anupam Datta
| On the Relationships Between Notions of Simulation-Based Security
|
| Anupam Datta
| Formal Derivation of Security Protocols
|
| |
| Al Davis
| Scaling Theory for Information Networks
|
| |
| Ante Derek
| A Modular Correctness Proof of IEEE 802.11i and TLS
|
| Ante Derek
| Formal Derivation of Security Protocols
|
| |
| Ante Derek
| Formal Analysis of Security Protocols: Protocol Composition Logic
|
| |
| Ante Derek
| Probabilistic polynomial-time semantics for a protocol security
logic
|
| Ante Derek
| The Impossibility of Realizable Ideal Functionality
|
| Ante Derek
| Compositional Analysis of Contract Signing Protocols
|
| Ante Derek
| A derivation system and compositional logic for security
protocols
|
| Ante Derek
| Abstraction and Refinement in Protocol Derivation
|
| Ante Derek
| Secure Protocol Composition
|
| |
| Yvo Desmedt
| Accountable Privacy
|
| |
| Petros Drineas
| A Randomized Algorithm for a Tensor-Based Generalization of the
Singular Value Decomposition
|
| Petros Drineas
| Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
|
| Petros Drineas
| Fast Monte Carlo Algorithms for Matrices II: Computing Low-Rank Approximations to a Matrix
|
| Petros Drineas
| Fast Monte Carlo Algorithms for Matrices III: Computing an Efficient Approximate Decomposition of a Matrix
|
| |
| Petros Drineas
| On the Nystrom Method for Approximating a Gram Matrix for Improved
Kernel-Based Learning
|
| |
| Petros Drineas
| Sampling Sub-problems of Heterogeneous Max-Cut Problems and Approximation
Algorithms
|
| |
| Wenliang Du
| Oblivious Signature-Based Envelope
|
| |
| Shaddin Dughmi
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| Cynthia Dwork
| Our Data, Ourselves: Privacy via Distributed Noise
Generation
|
| |
| Cynthia Dwork
| Privacy-preserving Datamining on Vertically Partitioned Databases
|
| Cynthia Dwork
| Toward Privacy in Public Databases
|
| |
| Nadav Eiron
| Ranking the Web Frontier
|
| |
| Thomas Eisenbach
| Flexibility as an Instrument in DRM Systems
|
| |
| Michael Elkin
| Efficient Algorithms for Constructing (1+\epsilon,\beta)-Spanners in the Distributed and Streaming Models
|
| |
| M. Enachescu
| Scale Free Aggregation in Sensor Networks
|
| |
| Fernando Esponda
| Enhancing Privacy through Negative Representations of Data
|
| Fernando Esponda
| On-line Negative Databases
|
| Fernando Esponda
| A formal framework for positive and negative detection
|
| |
| Fernando Esponda
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Fernando Esponda
| Protecting Data Privacy through Hard-to-Reverse Negative Databases
|
| |
| Fernando Esponda
| Negative Representations of Information
|
| |
| Fernando Esponda
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| Fernando Esponda
| Anonymous Data Collection in Sensor Networks
|
| |
| Alex Fabraikant
| On the Structure of Weakly-Acyclic Games
|
| |
| Christos Faloutsos
| Connection Subgraphs in Social Networks
|
| |
| Tomas Feder
| Algorithms for the Database Layout Problem
|
| |
| Tomas Feder
| Achieving Anonymity via Clustering
|
| Tomas Feder
| Approximation Algorithms for k-Anonymity
|
| Tomas Feder
| Anonymizing Tables
|
| Tomas Feder
| k-Anonymity: Algorithms and Hardness
|
| |
| Joan Feigenbaum
| Approximate privacy: foundations and quantification
|
| Joan Feigenbaum
| Usability of Browser-Based Tools for Web-Search Privacy
|
| |
| Joan Feigenbaum
| Implementing Privacy-Preserving Bayesian-Net
Discovery for Vertically Partitioned Data
|
| |
| Joan Feigenbaum
| A Model of Onion Routing with Provable Anonymity
|
| Joan Feigenbaum
| Private Web Search
|
| Joan Feigenbaum
| Probabilistic Analysis of Onion Routing
in a Black-box Model
|
| Joan Feigenbaum
| Finding Highly Correlated Pairs Efficiently with Powerful
Pruning
|
| |
| Joan Feigenbaum
| Secure Multiparty Computation of Approximations
|
| |
| Joan Feigenbaum
| Flexibility as an Instrument in DRM Systems
|
| Joan Feigenbaum
| Privacy Engineering in Digital Rights Management Systems
|
| |
| Joan Feigenbaum
| Towards a Theory of Data Entanglement
|
| Joan Feigenbaum
| Some Requirements for Adoption of Privacy-Preserving Data Mining
|
| Joan Feigenbaum
| Computing Diameter in the Streaming and Sliding-Window Models
|
| Joan Feigenbaum
| Graph Distances in the Streaming Model: The Value of Space
|
| Joan Feigenbaum
| Untitled white paper on "Malevolence in the
Cyberinfrastructure"
|
| Joan Feigenbaum
| Towards an Economic Analysis of Trusted Systems (Position Paper)
|
| Joan Feigenbaum
| On Graph Problems in a Semi-Streaming Model
|
| Joan Feigenbaum
| Secure Computation of Surveys
|
| Joan Feigenbaum
| PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment
|
| |
| Joan
Feigenbaum | Learning-Based Anomaly Detection in BGP Updates
|
| |
| Joan Feigenbaum
| Preventing Active Timing Attacks in Low-Latency Anonymous Communication
|
| Joan Feigenbaum
| Approximate Privacy: Foundations and Quantification (Extended Abstract)
|
| Joan Feigenbaum
| Approximate Privacy: PARs for Set Problems
|
| Joan Feigenbaum
| Approximate Privacy: Foundations and Quantification
|
| Joan Feigenbaum
| Computational Challenges in E-commerce
|
| Joan Feigenbaum
| Information Accountability
|
| |
| Joan Feigenbaum
| Towards Better Support for Copyright Compliance and for Privacy
|
| |
| Michael J. Fischer
| Stabilizing Consensus in Mobile Networks
|
| |
| Michael J. Fischer
| Self-stabilizing Leader Election in Networks of Finite-state
Anonymous Agents
|
| |
| Michael J. Fischer
| Stably computable properties of network graphs
|
| Michael J. Fischer
| Typed Computational Email for Serverless Distributed Applications
|
| |
| Michael J. Fischer
| Self-stabilizing behavior in networks of nondeterministically
interacting sensors
|
| |
| Robert Fischer
| Typed Computational Email for Serverless Distributed Applications
|
| |
| Staphanie Forrest
| Radial Structure of the Internet
|
| |
| Stephanie Forrest
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| Stephanie Forrest
| Anonymous Data Collection in Sensor Networks
|
| Stephanie Forrest
| Increasing Communications Security through Protocol Parameter Diversity
|
| Stephanie Forrest
| Pretty Good BGP: Improving BGP by cautiously adopting
routes
|
| Stephanie Forrest
| Learning DFA representations of HTTP for protecting web
applications
|
| |
| Stephanie Forrest
| Protecting Data Privacy through Hard-to-Reverse Negative Databases
|
| Stephanie Forrest
| Autonomous Security for Autonomous Systems
|
| Stephanie Forrest
| An Integrated Model of Traffic, Geography and Economy in the Internet
|
| Stephanie Forrest
| Scaling Theory for Information Networks
|
| |
| Stephanie Forrest
| Randomized Instruction Set Emulation
|
| Stephanie Forrest
| Computation in the Wild
|
| Stephanie Forrest
| Enhancing Privacy through Negative Representations of Data
|
| Stephanie Forrest
| On-line Negative Databases
|
| Stephanie Forrest
| Technological Networks and the Spread of Computer Viruses
|
| Stephanie Forrest
| A formal framework for positive and negative detection
|
| Stephanie Forrest
| Java object lifetimes are predictable
|
| |
| Stephanie Forrest
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Mike Frame
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Michael Freedman
| Efficient Private Matching and Set Intersection
|
| |
| Michael Freedman
| Privacy Engineering in Digital Rights Management Systems
|
| |
| Alan Frieze
| A new approach to the planted clique problem
|
| |
| Anne Frondorf
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Hu Fu
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| Prasanna Ganesan
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| |
| Prasanna Ganesan
| SPROUT: P2P Routing with Social Networks
|
| Prasanna Ganesan
| SPROUT: P2P Routing with Social Networks (extended version)
|
| Prasanna Ganesan
| Enabling Privacy for the Paranoids
|
| Prasanna Ganesan
| Optimal Routing in Chord
|
| Prasanna Ganesan
| DHT Routing Using Social Links
|
| |
| V. Ganti
| Robust identification of fuzzy duplicates
|
| |
| Hector Garcia-Molina
| Limited Reputation Sharing in P2P Systems
|
| Hector Garcia-Molina
| SPROUT: P2P Routing with Social Networks
|
| Hector Garcia-Molina
| SPROUT: P2P Routing with Social Networks (extended version)
|
| Hector Garcia-Molina
| Enabling Privacy for the Paranoids
|
| Hector Garcia-Molina
| The Price of Validity in Dynamic Networks
|
| Hector Garcia-Molina
| DHT Routing Using Social Links
|
| |
| Hector Garcia-Molina
| Security Configuration Management
|
| |
| Hector Garcia-Molina
| Swoosh: A Generic Approach to Entity Resolution
|
| Hector Garcia-Molina
| Generic Entity Resolution with Data Confidences
|
| |
| Hector Garcia-Molina
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| Hector Garcia-Molina
| Generic Entity Resolution with Data Confidences
|
| Hector Garcia-Molina
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| |
| Tal Garfinkel
| Reducing Shoulder-surfing by Using Gaze-based Password Entry
|
| |
| C. Gentry
| Space-Efficient Identity Based Encryption Without Pairings
|
| |
| Craig Gentry
| Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
|
| |
| Craig Gentry
| Aggregate and Verifiably Encrytped Signatures from Bilinear
Maps
|
| |
| Craig Gentry
| A Survey of Two Signature Aggregation Techniques
|
| |
| Aristides Gionis
| The Price of Validity in Dynamic Networks
|
| |
| Matthew Glickman
| Computation in the Wild
|
| |
| Brighten Godfrey
| Incentive compatibility and dynamics of congestion control
|
| |
| Michael Godwin
| Digital Rights Management: A Guide for Librarians
|
| |
| Mike Godwin
| A Modest Proposal: Libel Law Reform in the Internet Era
|
| |
| A. Goel
| Scale Free Aggregation in Sensor Networks
|
| |
| Eu-Jin Goh
| Hierarchical Identity Based Encryption with Constant Size
Ciphertext
|
| |
| Eu-Jin Goh
| On the Effectiveness of Address-Space Randomization
|
| Eu-Jin Goh
| Building Secure Indexes for Searching Efficiently on Encrypted Compressed data
|
| |
| Eu-Jin Goh
| Encryption Schemes from Bilinear Maps
|
| |
| Eu-Jin Goh
| Evaluating 2-DNF Formulas on Ciphertexts
|
| |
| Sharon Goldberg
| How secure are secure interdomain routing protocols?
|
| |
| B. Gourdin
| Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks
|
| |
| R. Govindan
| Scale Free Aggregation in Sensor Networks
|
| |
| Ashley Green
| Sensitive Information in a Wired World
|
| |
| Ashley Green
| The Private Database
|
| |
| James Grimmelman
| Policy Responses to Spam
|
| |
| Alvaro Gutierrez
| Towards Better Digital Identity Management
|
| |
| H. Hajime
| Java object lifetimes are predictable
|
| |
| M. Hamburg
| Space-Efficient Identity Based Encryption Without Pairings
|
| |
| Changhua He
| A Modular Correctness Proof of IEEE 802.11i and TLS
|
| |
| Paul Helman
| Protecting Data Privacy through Hard-to-Reverse Negative Databases
|
| |
| Paul Helman
| Enhancing Privacy through Negative Representations of Data
|
| |
| Paul Helman
| On-line Negative Databases
|
| Paul Helman
| A formal framework for positive and negative detection
|
| |
| Paul Helman
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Paul Helman
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| James Hendler
| Information Accountability
|
| |
| Dan Holevoet
| Copyright Reforms for the Digital Age: A Closer Look at
Google
|
| |
| Petter Holme
| Radial Structure of the Internet
|
| |
| Petter Holme
| An Integrated Model of Traffic, Geography and Economy in the Internet
|
| |
| John Hopcroft
| Spectral Clustering with Limited Independence
|
| |
| John Hopcroft
| Spectral Clustering by Recursive Partitioning
|
| |
| James Horey
| Anonymous Data Collection in Sensor Networks
|
| |
| Jeremy Horwitz
| Applications of Cayley Graphs, Bilinearity, and Higher-Order Residues to Cryptology
|
| |
| Jeremy Horwitz
| Toward Heirarchical Identity-Based Encryption
|
| |
| Daniel C. Howe
| TrackMeNot: Resisting Surveillance in Web Search
|
| |
| Peter Hummon
| How secure are secure interdomain routing protocols?
|
| |
| Ken Ingham
| Learning DFA representations of HTTP for protecting web
applications
|
| |
|
Yuval Ishai
| Private Multiparty Sampling and Approximation of Vector Combinations
|
| |
| Yuval Ishai
| Secure Multiparty Computation of Approximations
|
| |
| C. Jackson
| An analysis of private browsing modes in modern browsers
|
| |
| C. Jackson
| Busting frame busting: a study of clickjacking vulnerabilities at popular sites
|
| C. Jackson
| Transaction Generators: Root Kits for the Web
|
| |
| Collin Jackson
| A Browser Plug-in Solution to the Unique Password Problem
|
| |
| Collin Jackson
| Stronger Password Authentication Using
Browser Extensions
|
| |
| Collin Jackson
| Protecting Browser State from Web Privacy Attacks
|
| |
|
Geetha Jagannathan
| Privacy-Preserving Data Imputation
|
| |
| Geetha Jagannathan
| Privacy-Preserving Distributed k-Means Clustering over Arbitrarily Partitioned Data
|
| |
| Aaron D. Jaggard
| Approximate privacy: foundations and quantification
|
| Aaron D. Jaggard
| On the Structure of Weakly-Acyclic Games
|
| Aaron D. Jaggard
| Distributed Computing With Adaptive Heuristics
|
| |
| Aaron D. Jaggard
| Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond
|
| |
| Aaron D. Jaggard
| Approximate Privacy: Foundations and Quantification (Extended Abstract)
|
| Aaron D. Jaggard
| Approximate Privacy: PARs for Set Problems
|
| Aaron D. Jaggard
| Approximate Privacy: Foundations and Quantification
|
| |
| Haixia Jia
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Haixia Jia
| Protecting Data Privacy through Hard-to-Reverse Negative
Databases
|
| |
| Haixia Jia
| Protecting Data Privacy through Hard-to-Reverse Negative Databases
|
| |
| Hong Jiang
| Distributed Systems of Simple Interacting Agents
|
| |
| Hong Jiang
| Self-stabilizing behavior in networks of nondeterministically
interacting sensors
|
| |
| Hong Jiang
| Stabilizing Consensus in Mobile Networks
|
| Hong Jiang
| Stably computable properties of network graphs
|
| Hong Jiang
| Typed Computational Email for Serverless Distributed Applications
|
| |
| Hong Jiang
| Self-stabilizing Leader Election in Networks of Finite-state
Anonymous Agents
|
| |
| Aaron Johnson
| A Model of Onion Routing with Provable Anonymity
|
| Aaron Johnson
| Private Web Search
|
| Aaron Johnson
| Probabilistic Analysis of Onion Routing
in a Black-box Model
|
| |
| Aaron Johnson
| Preventing Active Timing Attacks in Low-Latency Anonymous Communication
|
| Aaron Johnson
| Design and Analysis of Efficient Anonymous-Communication Protocols
|
| |
| Jeff Jonas
| Swoosh: A Generic Approach to Entity Resolution
|
| |
| Roberto Bayardo Jr.
| Privacy Preserving Indexing of Documents on the Network
|
| |
| Ravi Kannan
| Spectral Clustering with Limited Independence
|
| Ravi Kannan
| The Space Complexity of Pass-Efficient Algorithms for Clustering
|
| Ravi Kannan
| Sampling Sub-problems of Heterogeneous Max-Cut Problems and Approximation
Algorithms
|
| |
| Ravi Kannan
| Spectral Clustering by Recursive Partitioning
|
| |
| Ravi Kannan
| A new approach to the planted clique problem
|
| |
| Ravi Kannan
| A Divide-and-Merge Methodology for Clustering
|
| Ravi Kannan
| Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
|
| Ravi Kannan
| Fast Monte Carlo Algorithms for Matrices II: Computing Low-Rank Approximations to a Matrix
|
| Ravi Kannan
| Fast Monte Carlo Algorithms for Matrices III: Computing an Efficient Approximate Decomposition of a Matrix
|
| |
| Sampath Kannan
| Computing Diameter in the Streaming and Sliding-Window Models
|
| Sampath Kannan
| Graph Distances in the Streaming Model: The Value of Space
|
| Sampath Kannan
| On Graph Problems in a Semi-Streaming Model
|
| |
| O. Kardes | Implementing Privacy-Preserving Bayesian-Net
Discovery for Vertically Partitioned Data
|
| |
| J. Karlin
| Pretty Good BGP: Improving BGP by cautiously adopting
routes
|
| |
| Josh Karlin
| Distributed Internet Security and Measurement
|
| Josh Karlin
| Autonomous Security for Autonomous Systems
|
| Josh Karlin
| An Integrated Model of Traffic, Geography and Economy in the Internet
|
| |
| Josh Karlin
| Radial Structure of the Internet
|
| |
| Hideki Kawai
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| |
| Krishnaram Kenthapadi
| Simulatable Auditing
|
| |
| Krishnaram Kenthapadi
| Enabling Privacy for the Paranoids
|
| |
| Krishnaram Kenthapadi
| Models and Algorithms for Data Privacy
|
| |
| Krishnaram Kenthapadi
| Balanced Allocation on Graphs
|
| Krishnaram Kenthapadi
| Achieving Anonymity via Clustering
|
| Krishnaram Kenthapadi
| Our Data, Ourselves: Privacy via Distributed Noise
Generation
|
| Krishnaram Kenthapadi
| Approximation Algorithms for k-Anonymity
|
| Krishnaram Kenthapadi
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| Krishnaram Kenthapadi
| Anonymizing Tables
|
| Krishnaram Kenthapadi
| k-Anonymity: Algorithms and Hardness
|
| |
| Krishnaram Kenthapadi
| Decentralized Algorithms using both Local and Random Probes
for P2P Load Balancing
|
| |
| A. Keshavarzian
| Achieving Stability in Networks of Input-Queued Switches
using a Local Online Scheduling Algorithm
|
| |
| Samir Khuller
| Achieving Anonymity via Clustering
|
| |
| Robert Kleinberg
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| C. Konig
| Scalable Exploration of Physical Database Design
|
| |
| Aleksandra Korolova
| Link Privacy in Social Networks
|
| |
| Nimrod Kozlovski
| Technology in service of accountability - watch the watchers
|
| |
| Nimrod Kozlovski
| A Paradigm Shift in Online Policing - Designing Accountable
Policing
|
| |
| M. Kumar
| Reducing Shoulder-surfing by Using Gaze-based Password Entry
|
| |
| N. Kumar
| Achieving Stability in Networks of Input-Queued Switches
using a Local Online Scheduling Algorithm
|
| |
| Ralf Kusters
| Sequential Probabilistic Process Calculus and Simulation-Based
Security
|
| Ralf Kusters
| Unifying Equivalence-Based Definitions of Protocol Security
|
| Ralf Kusters
| On the Relationships Between Notions of Simulation-Based Security
|
| |
| Eric Landis
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Tait Larson
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| |
| Robert Ledesma
| Client-side defense against web-based identity theft
|
| |
| Ninghui Li
| Oblivious Signature-Based Envelope
|
| |
| Michael Lodder
| Scaling Theory for Information Networks
|
| |
| AL Lodge
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Sachin Lodha
| Probabilistic Anonymity
|
| |
| Charlin Lu
| Powerful Privacy Potential: P3P in the Context of
Legislation and Education
|
| |
| Ben Lynn
| A Survey of Two Signature Aggregation Techniques
|
| |
| Ben Lynn
| On the Implementation of Pairing-Based Cryptosystems
|
| Ben Lynn
| Positive Results and Techniques for Obfuscation
|
| Ben Lynn
| Efficient Implementation of Pairing-Based Cryptosystems
|
| Ben Lynn
| Short Signatures from the Weil Pairing
|
| Ben Lynn
| On the Selection of Pairing-Friendly Groups
|
| Ben Lynn
| Aggregate and Verifiably Encrytped Signatures from Bilinear
Maps
|
| Ben Lynn
| Authenticated Identity-Based Encryption
|
| Ben Lynn
| Constructing Elliptic Curves with Prescribed Embedding Degrees
|
| Ben Lynn
| Toward Heirarchical Identity-Based Encryption
|
| |
| Anna Lysyanskaya
| Sequential Aggregate Signatures from Trapdoor Permutations
|
| |
| Michael M.Groat
| Anonymous Data Collection in Sensor Networks
|
| |
| Michael W. Mahoney
| Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
|
| Michael W. Mahoney
| Fast Monte Carlo Algorithms for Matrices II: Computing Low-Rank Approximations to a Matrix
|
| Michael W. Mahoney
| Fast Monte Carlo Algorithms for Matrices III: Computing an Efficient Approximate Decomposition of a Matrix
|
| |
| Michael W. Mahoney
| Sampling Sub-problems of Heterogeneous Max-Cut Problems and Approximation
Algorithms
|
| |
| Michael W. Mahoney
| A Randomized Algorithm for a Tensor-Based Generalization of the
Singular Value Decomposition
|
| |
| Michael W. Mahoney
| On the Nystrom Method for Approximating a Gram Matrix for Improved
Kernel-Based Learning
|
| |
| David Maier
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Dahlia Malkhi
| Fairplay -- A Secure Two-Party Computation System
|
| |
| Tal Malkin
| Secure Multiparty Computation of Approximations
|
| |
|
Tal Malkin
| Private Multiparty Sampling and Approximation of Vector Combinations
|
| |
| G. S. Manku
| Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks
|
| G. S. Manku
| Optimal Routing in Chord
|
| G. S. Manku
| Approximate Counts and Quantiles over Sliding Windows
|
| G. S. Manku
| Randomized ID Selection for Peer to Peer Networks
|
| |
| G. S. Manku
| Decentralized Algorithms using both Local and Random Probes
for P2P Load Balancing
|
| |
| G. S. Manku
| Dipsea: A Modular Distributed Hash Table |
| |
| Luis Marenco
| Dynamic Tables: An Architecture for Managing Evolving, Heterogeneous Biomedical Data in Relational Database Management Systems
|
| |
| Sergio Marti
| Limited Reputation Sharing in P2P Systems
|
| Sergio Marti
| SPROUT: P2P Routing with Social Networks
|
| Sergio Marti
| SPROUT: P2P Routing with Social Networks (extended version)
|
| Sergio Marti
| DHT Routing Using Social Links
|
| |
| Sergio Marti
| Trust and reputation in peer-to-peer networks
|
| |
| DJ McBride
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Kevin S. McCurley
| Ranking the Web Frontier
|
| Kevin S. McCurley
| Connection Subgraphs in Social Networks
|
| |
| Katherine McDaniel
| A Modest Proposal: Libel Law Reform in the Internet Era
|
| |
| Andrew McGregor
| Graph Distances in the Streaming Model: The Value of Space
|
| Andrew McGregor
| On Graph Problems in a Semi-Streaming Model
|
| |
| Frank McSherry
| Toward Privacy in Public Databases
|
| |
| Frank McSherry
| Our Data, Ourselves: Privacy via Distributed Noise
Generation
|
| |
| Qixiang Mei
| Direct Chosen Ciphertext Security from Identity-Based Techniques
|
| |
| David Menestrina
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| David Menestrina
| Generic Entity Resolution with Data Confidences
|
| |
| David Menestrina
| Generic Entity Resolution with Data Confidences
|
| |
| Michael Merritt
| Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
|
| |
| Silvio Micali
| Sequential Aggregate Signatures from Trapdoor Permutations
|
| |
| Perry L. Miller
| Dynamic Tables: An Architecture for Managing Evolving, Heterogeneous Biomedical Data in Relational Database Management Systems
|
| |
| Ilya Mironov
| Our Data, Ourselves: Privacy via Distributed Noise
Generation
|
| |
| Nina Mishra
| Enabling Privacy for the Paranoids
|
| Nina Mishra
| Secure computation of the k'th-ranked element
|
| |
| Nina Mishra
| Simulatable Auditing
|
| |
| BD Mitchell
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| J. Mitchell
| Transaction Generators: Root Kits for the Web
|
| |
| John C. Mitchell
| A Modular Correctness Proof of IEEE 802.11i and TLS
|
| John C. Mitchell
| Secure Protocol Composition
|
| |
| John C. Mitchell
| Protecting Browser State from Web Privacy Attacks
|
| John C. Mitchell
| Probabilistic polynomial-time semantics for a protocol security
logic
|
| John C. Mitchell
| The Impossibility of Realizable Ideal Functionality
|
| John C. Mitchell
| Compositional Analysis of Contract Signing Protocols
|
| John C. Mitchell
| Enterprise Privacy Promises and Enforcement
|
| John C. Mitchell
| A derivation system and compositional logic for security
protocols
|
| John C. Mitchell
| Sequential Probabilistic Process Calculus and Simulation-Based
Security
|
| John C. Mitchell
| Unifying Equivalence-Based Definitions of Protocol Security
|
| John C. Mitchell
| Client-side defense against web-based identity theft
|
| John C. Mitchell
| Conflict and Combination in Privacy Policy Languages
|
| John C. Mitchell
| Abstraction and Refinement in Protocol Derivation
|
| John C. Mitchell
| On the Relationships Between Notions of Simulation-Based Security
|
| John C. Mitchell
| Formal Derivation of Security Protocols
|
| |
| John C. Mitchell
| Privacy and Contextual Integrity: Framework and
Applications
|
| John C. Mitchell
| Managing Digital Rights using Linear Logic
|
| |
| John C. Mitchell
| A Browser Plug-in Solution to the Unique Password Problem
|
| |
| John C Mitchell
| Stronger Password Authentication Using
Browser Extensions
|
| |
| Pradipta Mitra
| Spectral Clustering by Recursive Partitioning
|
| |
| Pradipta Mitra
| Clustering Algorithms for Random and Pseudo-random Structures
|
| |
| Pradipta Mitra
| Spectral Clustering with Limited Independence
|
| |
| Nicholas Miyake
| A Browser Plug-in Solution to the Unique Password Problem
|
| |
| Nicholas Miyake
| Stronger Password Authentication Using
Browser Extensions
|
| |
| Nagendra Modadugu
| Security for Real-World Networked Applications
|
| |
| Nagendra Modadugu
| On the Effectiveness of Address-Space Randomization
|
| |
| Melanie Moses
| Scaling Theory for Information Networks
|
| |
| Elchanan Mossel
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| Rajeev Motwani
| Algorithms for the Database Layout Problem
|
| Rajeev Motwani
| Adaptive Ordering of Pipelined Stream Filters
|
| Rajeev Motwani
| Enabling Privacy for the Paranoids
|
| Rajeev Motwani
| The Price of Validity in Dynamic Networks
|
| Rajeev Motwani
| Load Shedding Techniques for Aggregation Queries in Stream Systems
|
| Rajeev Motwani
| Scale Free Aggregation in Sensor Networks
|
| Rajeev Motwani
| Operator scheduling in data stream systems
|
| |
| Rajeev Motwani
| Efficient Algorithms for Finding and Masking Quasi-Identifiers
|
| Rajeev Motwani
| Link Privacy in Social Networks
|
| Rajeev Motwani
| Auditing SQL Queries
|
| |
| Rajeev Motwani
| Approximation Algorithms for k-Anonymity
|
| Rajeev Motwani
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| Rajeev Motwani
| Anonymizing Tables
|
| Rajeev Motwani
| The Pipelined Set Cover Problem
|
| Rajeev Motwani
| Adaptive Caching for Continuous Queries
|
| Rajeev Motwani
| Robust identification of fuzzy duplicates
|
| Rajeev Motwani
| k-Anonymity: Algorithms and Hardness
|
| |
| K. Munagala
| The Pipelined Set Cover Problem
|
| K. Munagala
| Adaptive Caching for Continuous Queries
|
| |
| S. Munagala
| Adaptive Ordering of Pipelined Stream Filters
|
| |
| Bob Mungamuru
| Security Configuration Management
|
| |
| S. U. Nabar
| Scalable Exploration of Physical Database Design
|
| S. U. Nabar
| Achieving Stability in Networks of Input-Queued Switches
using a Local Online Scheduling Algorithm
|
| |
| Shubha U. Nabar
| Link Privacy in Social Networks
|
| Shubha U. Nabar
| Auditing SQL Queries
|
| |
| P. Nandy
| Exposing private information by timing web applications
|
| |
| M. Naor
| Traitor Tracing with Constant Size Ciphertext
|
| |
| Moni Naor
| Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks
|
| |
| Moni Naor
| Our Data, Ourselves: Privacy via Distributed Noise
Generation
|
| |
| A. Narayanan
| Privacy preserving targeted advertising
|
| |
| M. Newman
| Technological Networks and the Spread of Computer Viruses
|
| |
| J. Niishizawa
| Adaptive Ordering of Pipelined Stream Filters
|
| |
| Noam Nisan
| Fairplay -- A Secure Two-Party Computation System
|
| |
| Noam Nisan
| Best-Response Mechanisms
|
| |
| H. Nissenbaum
| Privacy preserving targeted advertising
|
| |
| Helen Nissenbaum
| Table of Contents for and Introduction to "Privacy in Context: Technology, Policy, and the Integrity of Social Life"
|
| Helen Nissenbaum
| TrackMeNot: Resisting Surveillance in Web Search
|
| |
| Helen Nissenbaum
| Privacy and Contextual Integrity: Framework and
Applications
|
| |
| Helen Nissenbaum
| Privacy as Contextual Integrity
|
| |
| Kobbi Nissim
| Privacy-preserving Datamining on Vertically Partitioned Databases
|
| Kobbi Nissim
| Efficient Private Matching and Set Intersection
|
| |
| Kobbi Nissim
| Evaluating 2-DNF Formulas on Ciphertexts
|
| Kobbi Nissim
| Simulatable Auditing
|
| |
| Kobbi Nissim
| Secure Multiparty Computation of Approximations
|
| |
| Chris Olston
| Security Configuration Management
|
| |
| Rafail Ostrovsky
| Searchable Public Key Encryption
|
| |
| M. Page
| On the Effectiveness of Address-Space Randomization
|
| |
| Rina Panigrahy
| Entropy based Nearest Neighbor Search in High
Dimensions
|
| |
| Rina Panigrahy
| Finding Frequent Elements in non-bursty Streams
|
| |
| Rina Panigrahy
| Algorithms for the Database Layout Problem
|
| |
| Rina Panigrahy
| Analyzing the Efficiency of BitTorrent and Related
Peer-to-Peer Networks
|
| Rina Panigrahy
| Balanced Allocation on Graphs
|
| Rina Panigrahy
| Achieving Anonymity via Clustering
|
| Rina Panigrahy
| Approximation Algorithms for k-Anonymity
|
| Rina Panigrahy
| Anonymizing Tables
|
| Rina Panigrahy
| k-Anonymity: Algorithms and Hardness
|
| |
| Christos Papadimitriou
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| A. Papakonstantinou
| On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
|
| |
| David C. Parkes
| Computational Challenges in E-commerce
|
| |
| Dusko Pavlovic
| A derivation system and compositional logic for security
protocols
|
| Dusko Pavlovic
| Formal Derivation of Security Protocols
|
| |
| Dusko Pavlovic
| Abstraction and Refinement in Protocol Derivation
|
| |
| David M. Pennock
| Computational Challenges in E-commerce
|
| |
| Rene Peralta
| Stably computable properties of network graphs
|
| |
| Giuseppe Persiano
| Searchable Public Key Encryption
|
| |
| B. Pfaff
| On the Effectiveness of Address-Space Randomization
|
| |
| Benny Pinkas
| Some Requirements for Adoption of Privacy-Preserving Data Mining
|
| Benny Pinkas
| Efficient Private Matching and Set Intersection
|
| Benny Pinkas
| Secure computation of the k'th-ranked element
|
| Benny Pinkas
| Secure Computation of Surveys
|
| Benny Pinkas
| Fairplay -- A Secure Two-Party Computation System
|
| |
| TI Pollin
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Manoj Prabhakaran
| Positive Results and Techniques for Obfuscation
|
| |
| Sarah Price
| Copyright Reforms for the Digital Age: A Closer Look at
Google
|
| |
| C. Rackoff
| On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
|
| |
| Sridhar Rajagopalan
| On the Streaming Model Augmented with a Sorting Primitive
|
| |
| Ajith Ramanathan
| On the Relationships Between Notions of Simulation-Based Security
|
| |
| Ajith Ramanathan
| The Impossibility of Realizable Ideal Functionality
|
| Ajith Ramanathan
| Sequential Probabilistic Process Calculus and Simulation-Based
Security
|
| Ajith Ramanathan
| Unifying Equivalence-Based Definitions of Protocol Security
|
| |
| Rajeev Rastogi
| Detection and Recovery Techniques for Database Corruption
|
| |
| Omer Reingold
| Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
|
| |
| J. Rexford
| Pretty Good BGP: Improving BGP by cautiously adopting
routes
|
| |
| Jennifer Rexford
| How secure are secure interdomain routing protocols?
|
| Jennifer Rexford
| Putting BGP on the Right Path: a Case for Next-Hop Routing
|
| Jennifer Rexford
| Neighbor-specific BGP: more flexible routing policies while improving global stability
|
| |
| Jennifer Rexford | Learning-Based Anomaly Detection in BGP Updates
|
| |
| Jennifer Rexfrod
| Autonomous Security for Autonomous Systems
|
| |
| Leonid Reyzin
| Sequential Aggregate Signatures from Trapdoor Permutations
|
| |
| Chris Riley
| Liability in Peer-to-Peer Systems
|
| |
| J. Rosenstein
| Conflict and Combination in Privacy Policy Languages
|
| |
| Blake Ross
| A Browser Plug-in Solution to the Unique Password Problem
|
| |
| Blake Ross
| Stronger Password Authentication Using
Browser Extensions
|
| |
| Boris Rotenberg
| The Legal Regulation of Software Interoperability in the European Union: Digital Communications Networks and the Need to Re-Assess the 1991 EU Software Directive
|
| |
| Matthias Ruhl
| On the Streaming Model Augmented with a Sorting Primitive
|
| |
| G. Rydstedt
| Busting frame busting: a study of clickjacking vulnerabilities at popular sites
|
| |
| G. Rydstedt
| Framing attacks on smart phones and dumb routers: tap-jacking and geo-localization attacks
|
| |
| Raphael
Ryger | Implementing Privacy-Preserving Bayesian-Net
Discovery for Vertically Partitioned Data
|
| |
| Raphael Ryger
| Some Requirements for Adoption of Privacy-Preserving Data Mining
|
| Raphael Ryger
| Secure Computation of Surveys
|
| |
| Amit Sahaj
| Positive Results and Techniques for Obfuscation
|
| |
| Felipe Saint-Jean
| Some Requirements for Adoption of Privacy-Preserving Data Mining
|
| |
| Felipe Saint-Jean
| Implementation and Evaluation of Privacy-Preserving Protocols
|
| |
| Felipe Saint-Jean
| A Java Implementation of a Single-Database Computationally Symmetric
Private Information Retrieval (cSPIR) protocol
|
| |
| Felipe Saint-Jean
| Private Web Search
|
| |
| Felipe Saint-Jean
| Secure Computation of Surveys
|
| |
| Felipe Saint-Jean
| Usability of Browser-Based Tools for Web-Search Privacy
|
| |
| Thomas Sander
| Privacy Engineering in Digital Rights Management Systems
|
| |
| Andre Scedrov
| The Impossibility of Realizable Ideal Functionality
|
| |
| AA Sch"affer
| Two Problems with Multiple Genetic Studies of the Same Disease
|
| |
| AA Sch"affer
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| AA Sch"affer
| Anabaptist Genealogy Database
|
| |
| Michael Schapira
| Inapproximability for VCG-Based Combinatorial Auctions
|
| Michael Schapira
| Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond
|
| |
| Michael Schapira
| Computation and incentives in combinatorial public projects
|
| Michael Schapira
| Approximate privacy: foundations and quantification
|
| Michael Schapira
| On the Structure of Weakly-Acyclic Games
|
| Michael Schapira
| Incentive compatibility and dynamics of congestion control
|
| Michael Schapira
| How secure are secure interdomain routing protocols?
|
| Michael Schapira
| Best-Response Mechanisms
|
| Michael Schapira
| Distributed Computing With Adaptive Heuristics
|
| Michael Schapira
| Putting BGP on the Right Path: a Case for Next-Hop Routing
|
| Michael Schapira
| Approximate Privacy: Foundations and Quantification (Extended Abstract)
|
| Michael Schapira
| Approximate Privacy: PARs for Set Problems
|
| Michael Schapira
| Neighbor-specific BGP: more flexible routing policies while improving global stability
|
| Michael Schapira
| Approximate Privacy: Foundations and Quantification
|
| |
| John L. Schnase
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Michael Scott
| Efficient Implementation of Pairing-Based Cryptosystems
|
| Michael Scott
| On the Selection of Pairing-Friendly Groups
|
| Michael Scott
| Constructing Elliptic Curves with Prescribed Embedding Degrees
|
| |
| Yaron Sella
| Fairplay -- A Secure Two-Party Computation System
|
| |
| S. Seshadri
| Detection and Recovery Techniques for Database Corruption
|
| |
| Hovav Shacham
| On the Effectiveness of Address-Space Randomization
|
| Hovav Shacham
| Short Group Signatures
|
| |
| Hovav Shacham
| New Paradigms in Signature Schemes
|
| Hovav Shacham
| A Survey of Two Signature Aggregation Techniques
|
| |
| Hovav Shacham
| Sequential Aggregate Signatures from Trapdoor Permutations
|
| |
| Hovav Shacham
| Group Signatures with Verifier-Local Revocation
|
| |
| Hovav Shacham
| Short Signatures from the Weil Pairing
|
| Hovav Shacham
| Aggregate and Verifiably Encrytped Signatures from Bilinear
Maps
|
| |
| JR Shapiro
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Scott Shenker
| Towards an Economic Analysis of Trusted Systems (Position Paper)
|
| |
| Scott Shenker
| Incentive compatibility and dynamics of congestion control
|
| |
| Scott Shenker
| Flexibility as an Instrument in DRM Systems
|
| |
| Vitaly Shmatikov
| Unifying Equivalence-Based Definitions of Protocol Security
|
| |
| Vitaly Shmatikov
| Probabilistic polynomial-time semantics for a protocol security
logic
|
| |
| Adam Shostack
| Privacy Engineering in Digital Rights Management Systems
|
| |
| AR Shuldiner
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Avi Silberschatz
|
Information technology challenges of biodiversity and ecosystems informatics
|
| |
| Avi Silberschatz
| Dynamic Tables: An Architecture for Managing Evolving, Heterogeneous Biomedical Data in Relational Database Management Systems
|
| |
| Avi Silberschatz
| PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment
|
| Avi Silberschatz
| Detection and Recovery Techniques for Database Corruption
|
| |
| Alice Silverberg
| Applications of Multilinear Forms to Cryptography
|
| |
| Yaron Singer
| Computation and incentives in combinatorial public projects
|
| |
| Yaron Singer
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| Adam Smith
| Toward Privacy in Public Databases
|
| |
| Jonathan Smith
| Towards an Economic Analysis of Trusted Systems (Position Paper)
|
| |
| Anil Somayaji
| Learning DFA representations of HTTP for protecting web
applications
|
| |
| R. Srikant
| Privacy Preserving OLAP
|
| |
| Utkarsh Srivastava
| Enabling Privacy for the Paranoids
|
| |
| Utkarsh Srivastava
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| |
| D. Stefanovic
| Randomized Instruction Set Emulation
|
| D. Stefanovic
| Java object lifetimes are predictable
|
| |
| DG Stinchcomb
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Martin J. Strauss
| Secure Multiparty Computation of Approximations
|
| |
|
Martin J. Strauss
| Private Multiparty Sampling and Approximation of Vector Combinations
|
| |
| EA Streeten
| Reduced Incidence of Hip Fracture in the Old Order Amish
|
| |
| Qi Su
| Swoosh: A Generic Approach to Entity Resolution
|
| |
| Hiran Subramaniam
| Experimental Analysis of Privacy-Preserving Statistics Computation
|
| |
| S. Sudarshan
| Detection and Recovery Techniques for Database Corruption
|
| |
| Mukund Sundararajan
| A Modular Correctness Proof of IEEE 802.11i and TLS
|
| |
| Mukund Sundararajan
| Trade-offs in Cost Sharing
|
| |
| Siddharth Suri
| Graph Distances in the Streaming Model: The Value of Space
|
| Siddharth Suri
| On Graph Problems in a Semi-Streaming Model
|
| |
| Gerald Jay Sussman
| Information Accountability
|
| |
| Paul Syverson
| A Model of Onion Routing with Provable Anonymity
|
| Paul Syverson
| Probabilistic Analysis of Onion Routing
in a Black-box Model
|
| |
| Paul Syverson
| Preventing Active Timing Attacks in Low-Latency Anonymous Communication
|
| |
| Gadi Taubenfeld
| Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
|
| |
| Yuka Teraguchi
| Client-side defense against web-based identity theft
|
| |
| Sutthipong Thavisomboon
| D-Swoosh: A Family of Algorithms for Generic, Distributed Entity
Resolution
|
| |
| Dilys Thomas
| Enabling Privacy for the Paranoids
|
| |
| Dilys Thomas
| Privacy Preserving OLAP
|
| |
| Dilys Thomas
| Achieving Anonymity via Clustering
|
| Dilys Thomas
| Approximation Algorithms for k-Anonymity
|
| Dilys Thomas
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| Dilys Thomas
| Anonymizing Tables
|
| Dilys Thomas
| k-Anonymity: Algorithms and Hardness
|
| |
| Dilys Thomas
| Algorithms and Architectures for Data Privacy
|
| Dilys Thomas
| Finding Frequent Elements in non-bursty Streams
|
| |
| Dilys Thomas
| Operator scheduling in data stream systems
|
| |
| Dilys Thomas
| Auditing SQL Queries
|
| |
| Dilys Thomas
| Probabilistic Anonymity
|
| |
| Andrew Tomkins
| Connection Subgraphs in Social Networks
|
| |
| John A. Tomlin
| Ranking the Web Frontier
|
| |
| V. Toubiana
| Privacy preserving targeted advertising
|
| |
| Will Tsui
| Digital Identity Management on the Internet
|
| |
| Mathieu Turuani
| Probabilistic polynomial-time semantics for a protocol security
logic
|
| Mathieu Turuani
| Compositional Analysis of Contract Signing Protocols
|
| |
| Chris Umans
| Inapproximability for VCG-Based Combinatorial Auctions
|
| |
| Y. Vahlis
| On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
|
| |
| Gregory Valiant
| Best-Response Mechanisms
|
| |
| Sergei Vassilvitskii
| On the Worst Case Complexity of the k-means Method
|
| |
| Bobby Vellanki
| The Private Database
|
| |
| Santosh Vempala
| A Divide-and-Merge Methodology for Clustering
|
| |
| Grant Wang
| A Divide-and-Merge Methodology for Clustering
|
| |
| Yi Wang
| Neighbor-specific BGP: more flexible routing policies while improving global stability
|
| |
| B. Waters
| On The Impossibility of Basing Identity Based Encryption on Trapdoor Permutations
|
| B. Waters
| Conjunctive, subset, and range queries on encrypted data
|
| |
| Brent Waters
| Direct Chosen Ciphertext Security from Identity-Based Techniques
|
| |
| Brent Waters
| Private encrypted content distribution using private broadcast
encryption
|
| |
| Brent Waters
| Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
|
| |
| Timothy M. Weber
| Values in a National Information Infrastructure: A Case Study
of the US Census
|
| |
| Hoeteck Wee
| Toward Privacy in Public Databases
|
| |
| Daniel J. Weitzner
| Information Accountability
|
| |
| Jennifer Widom
| Adaptive Ordering of Pipelined Stream Filters
|
| Jennifer Widom
| Enabling Privacy for the Paranoids
|
| |
| Jennifer Widom
| Swoosh: A Generic Approach to Entity Resolution
|
| |
| Jennifer Widom
| The Pipelined Set Cover Problem
|
| Jennifer Widom
| Adaptive Caching for Continuous Queries
|
| |
| U Wieder
| Know thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks
|
| |
| M. Williamson
| Technological Networks and the Spread of Computer Viruses
|
| |
| T. Winograd
| Reducing Shoulder-surfing by Using Gaze-based Password Entry
|
| |
| Rebecca N. Wright
| Distributed Computing With Adaptive Heuristics
|
| Rebecca N. Wright
| Secure Multiparty Computation of Approximations
|
| |
| Rebecca N. Wright
| Towards a Unified Approach to (In)Decision: Routing, Games, Circuits, Consensus, and Beyond
|
| |
| Rebecca N. Wright
| Implementing Privacy-Preserving Bayesian-Net
Discovery for Vertically Partitioned Data
|
| |
| Rebecca N. Wright
| Privacy-Preserving Classification of Customer Data without Loss of Accuracy
|
| Rebecca N. Wright
| Privacy-Enhancing k-Anonymization of Customer Data
|
| Rebecca N. Wright
| Improved Privacy-Preserving Bayesian Network Parameter Learning on Vertically Partitioned Data
|
| Rebecca N. Wright
| Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes
|
| Rebecca N. Wright
| Privacy-Preserving Distributed k-Means Clustering over Arbitrarily Partitioned Data
|
| Rebecca N. Wright
| Anonymity-Preserving Data Collection
|
| Rebecca N. Wright
| Accountable Privacy
|
| Rebecca N. Wright
| Experimental Analysis of Privacy-Preserving Statistics Computation
|
| Rebecca N. Wright
| Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data
|
| Rebecca N. Wright
| PORTIA: Privacy, Obligations, and Rights in Technologies of Information Assessment
|
| |
|
Rebecca N. Wright
| Private Multiparty Sampling and Approximation of Vector Combinations
|
|
Rebecca N. Wright
| Privacy-Preserving Data Imputation
|
|
Rebecca N. Wright
| Privacy-Preserving Queries on Encrypted Data
|
|
Rebecca N. Wright
| Privacy-Preserving Computation of Bayesian
Networks on Vertically Partitioned Data
|
| |
| Ying Xu
| Two Can Keep a Secret: A Distributed Architecture for Secure Database
|
| |
| Ying Xu
| Efficient Algorithms for Finding and Masking Quasi-Identifiers
|
| Ying Xu
| Link Privacy in Social Networks
|
| |
| Ying Xu
| Enabling Privacy for the Paranoids
|
| |
| Aleksandr Yampolskiy
| Towards a Theory of Data Entanglement
|
| Aleksandr Yampolskiy
| Inoculation strategies for victims of viruses and the sum-of-squares partition problem
|
| |
| Beverly Yang
| Resource Discovery in Peer-to-Peer Systems
|
| |
|
Zhiqiang Yang
| Privacy-Preserving Computation of Bayesian
Networks on Vertically Partitioned Data
|
| |
| Zhiqiang Yang
| Distributed Protocols for Data Privacy
|
| Zhiqiang Yang
| Privacy-Preserving Queries on Encrypted Data
|
| |
| Zhiqiang Yang
| Privacy-Preserving Classification of Customer Data without Loss of Accuracy
|
| Zhiqiang Yang
| Privacy-Enhancing k-Anonymization of Customer Data
|
| Zhiqiang Yang
| Improved Privacy-Preserving Bayesian Network Parameter Learning on Vertically Partitioned Data
|
| Zhiqiang Yang
| Anonymity-Preserving Data Collection
|
| Zhiqiang Yang
| Experimental Analysis of Privacy-Preserving Statistics Computation
|
| Zhiqiang Yang
| Privacy-Preserving Bayesian Network Structure Computation on Distributed Heterogeneous Data
|
| |
| Alec Yasinsac
| Accountable Privacy
|
| |
| Jamie Yoo
|
Controlling Sensitive Information
|
| |
| Jian Zhang | Learning-Based Anomaly Detection in BGP Updates
|
| |
| Jian Zhang
| Computing Diameter in the Streaming and Sliding-Window Models
|
| Jian Zhang
| Efficient Algorithms for Constructing (1+\epsilon,\beta)-Spanners in the Distributed and Streaming Models
|
| Jian Zhang
| On Graph Problems in a Semi-Streaming Model
|
| |
| Jian Zhang
| Massive Data Streams in Graph Theory and Computational Geometry
|
| |
| Jian Zhang
| Finding Highly Correlated Pairs Efficiently with Powerful
Pruning
|
| |
| Jian Zhang.
| Graph Distances in the Streaming Model: The Value of Space
|
| |
|
Sheng Zhong
| Privacy-Preserving Queries on Encrypted Data
|
| |
| Sheng Zhong
| Towards a Theory of Data Entanglement
|
| Sheng Zhong
| Privacy-Preserving Classification of Customer Data without Loss of Accuracy
|
| Sheng Zhong
| Privacy-Enhancing k-Anonymization of Customer Data
|
| Sheng Zhong
| Anonymity-Preserving Data Collection
|
| |
| An Zhu
| Anonymizing Tables
|
| |
| An Zhu
| Achieving Anonymity via Clustering
|
| An Zhu
| Approximation Algorithms for k-Anonymity
|
| An Zhu
| k-Anonymity: Algorithms and Hardness
|
| An Zhu
| Online Computations in Scheduling and Network Applications
|
| |
| An Zhu
| Algorithms for the Database Layout Problem
|
| |
| Yaping Zhu
| Putting BGP on the Right Path: a Case for Next-Hop Routing
|
| |
| Michael Zimmer
| The Quest for the Perfect Search Engine: Values,
Technical Design, and the Flow of Personal Information in Spheres of Mobility
|
| |
| Michael T. Zimmer
| Surveillance, privacy and the ethics of vehicle safety
communication technologies
|
| Michael T. Zimmer
| Personal Information and the Design of Vehicle Safety Communication Technologies: an Application of Privacy as Contextual Integrity
|
| |
| Aviv Zohar
| Incentive compatibility and dynamics of congestion control
|
| Aviv Zohar
| Best-Response Mechanisms
|
