William Aiello

According to our database1, William Aiello authored at least 58 papers between 1986 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Beeswax: a platform for private web apps.
PoPETs, 2016

Shuffler: Fast and Deployable Continuous Code Re-Randomization.
Proceedings of the 12th USENIX Symposium on Operating Systems Design and Implementation, 2016

Precisely Measuring Quantitative Information Flow: 10K Lines of Code and Beyond.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

2013
Whose cache line is it anyway?: operating system support for live detection and repair of false sharing.
Proceedings of the Eighth Eurosys Conference 2013, 2013

Tolerating business failures in hosted applications.
Proceedings of the ACM Symposium on Cloud Computing, SOCC '13, 2013

2011
Herbert West - Deanonymizer.
Proceedings of the 6th USENIX Workshop on Hot Topics in Security, 2011

Breaking up is hard to do: security and functionality in a commodity hypervisor.
Proceedings of the 23rd ACM Symposium on Operating Systems Principles 2011, 2011

Protecting consumer privacy from electric load monitoring.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2009
Configuration management at massive scale: system design and experience.
IEEE Journal on Selected Areas in Communications, 2009

2008
Competitive buffer management for shared-memory switches.
ACM Trans. Algorithms, 2008

2007
Hamming Codes, Hypercube Embeddings, and Fault Tolerance.
SIAM J. Comput., 2007

A Spatial Web Graph Model with Local Influence Regions.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Configuration Management at Massive Scale: System Design and Experience.
Proceedings of the 2007 USENIX Annual Technical Conference, 2007

2006
Origin authentication in interdomain routing.
Computer Networks, 2006

Characterization of Graphs Using Degree Cores.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Workshop on Algorithms and Models for the Web Graph.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Modelling and Mining of Networked Information Spaces.
Proceedings of the Algorithms and Models for the Web-Graph, Fourth International Workshop, 2006

Enterprise Security: A Community of Interest Based Approach.
Proceedings of the Network and Distributed System Security Symposium, 2006

Optimizing BGP security by exploiting path stability.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

2005
Analysis of Communities of Interest in Data Networks.
Proceedings of the Passive and Active Network Measurement, 6th International Workshop, 2005

Sparse Approximations for High Fidelity Compression of Network Traffic Data.
Proceedings of the 5th Internet Measurement Conference, 2005

2004
Just fast keying: Key agreement in a hostile internet.
ACM Trans. Inf. Syst. Secur., 2004

2003
Dynamic routing on networks with fixed-size buffers.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Working around BGP: An Incremental Approach to Improving Security and Accuracy in Interdomain Routing.
Proceedings of the Network and Distributed System Security Symposium, 2003

Origin authentication in interdomain routing.
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003

2002
Efficient, DoS-resistant, secure key exchange for internet protocols.
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002

2001
Tree Search on an Atomic Model for Message Passing.
SIAM J. Comput., 2001

A Random Graph Model for Power Law Graphs.
Experimental Mathematics, 2001

Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols.
Proceedings of the Security Protocols, 2001

Random Evolution in Massive Graphs.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Priced Oblivious Transfer: How to Sell Digital Goods.
Proceedings of the Advances in Cryptology, 2001

2000
A random graph model for massive graphs.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Competitive Queue Policies for Differentiated Services.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Supporting Increment and Decrement Operations in Balancing Networks.
Proceedings of the STACS 99, 1999

Augmented Ring Networks.
Proceedings of the SIROCCO'99, 1999

High-Speed Pseudorandom Number Generation with Small Memory.
Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

Using Smartcards to Secure a Personalized Gambling Device.
Proceedings of the CCS '99, 1999

1998
Design of Practical and Provably Good Random Number Generators.
J. Algorithms, 1998

Adaptive Packet Routing for Bursty Adversarial Traffic.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

New Constructions for Secure Hash Functions.
Proceedings of the Fast Software Encryption, 5th International Workshop, 1998

Fast Digital Identity Revocation (Extended Abstract).
Proceedings of the Advances in Cryptology, 1998

Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers.
Proceedings of the Advances in Cryptology, 1998

1996
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel.
Proceedings of the Advances in Cryptology, 1996

1995
Knowledge on the average-perfect, statistical and logarithmic.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Design of Practical and Provably Good Random Number Generators (Extended Abstract).
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994
Coins, Weights and Contention in Balancing Networks.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Sparse Matrix Computations on Parallel Processor Arrays.
SIAM J. Scientific Computing, 1993

Approximate load balancing on dynamic and asynchronous networks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

An Atomic Model for Message-Passing.
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, 1993

1991
Relativized Perfect Zero Knowledge Is Not BPP
Inf. Comput., August, 1991

Statistical Zero-Knowledge Languages can be Recognized in Two Rounds.
J. Comput. Syst. Sci., 1991

Coding Theory, Hypercube Embeddings, and Fault Tolerance.
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

Learning the Fourier Spectrum of Probabilistic Lists and Trees.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
On the power of interaction.
Combinatorica, 1990

Fast Algorithms for Bit-Serial Routing on a Hypercube.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1987
Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
On the Power of Interaction
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986


  Loading...