Planning for the Future of Cyber Attack Attribution : Hearing Before the H. Subcomm. on Technology and Innovation of the H. Comm. on Science and Technology, 111th Cong., July 15, 2010 (Statement by Adjunct Professor Marc Rotenberg, Geo. U. L. Center)

Steve Bellovin, another security expert, noted recently that one of risks of the new White House plan for cyber security is that it places too much emphasis on attribution. As Dr. Bellovin explains: The fundamental premise of the proposed strategy is that our serious Internet security problems are due to lack of sufficient authentication. That is demonstrably false. The biggest problem was and is buggy code. All the authentication in the world won\u27t stop a bad guy who goes around the authentication system, either by finding bugs exploitable before authentication is performed, finding bugs in the authentication system itself, or by hijacking your system and abusing the authenticated connection set up by the legitimate user. While I believe the White House, the Cyber Security Advisor, and the various participants in the drafting process have made an important effort to address privacy and security interests, I share Professor Bellovin’s concern that too much emphasis has been placed on promoting identification. I also believe that online identification, promoted by government, will be used for purposes unrelated to cyber security and could ultimately chill political speech and limit the growth of the Internet. Greater public participation in the development of this policy as well as a formal rulemaking on the White House proposal could help address these concerns

Online Privacy, Social Networking, and Crime Victimization : Hearing Before the H. Subcomm. on Crime, Terrorism, and Homeland Security of the H. Comm. on the Judiciary, 111th Cong., July 28, 2010 (Statement by Adjunct Professor Marc Rotenberg, Geo. U. L. Center)

Mr. Chairman, Facebook is a tremendous service, with the scope of email, the telephone, and even the Internet itself. It is also the source of many of the privacy concerns of users today. The critical problem is not what users post; it is that the Facebook changes the privacy settings too frequently and Facebook makes it too difficult for users to selectively post information. Self‐regulation has not worked because the FTC has been reluctant to pursue investigations. So, EPIC recommends changes to ECPA in Title 18 that would give users greater control of their information and reduce risk when they go online

Restoring a Public Interest Vision of Law in the Age of the Internet

In November 2003, Mr. Marc Rotenberg, Executive Director of the Electronic Privacy Information Center, lectured at Duke Law School on the importance of protecting individual privacy. In his remarks, Mr. Rotenberg recounted the successful campaign against the government\u27s Clipper Chip proposal. He argued that successful public interest advocacy in the Internet age requires the participation of experts from many fields, public engagement, and a willingness to avoid a simple balancing analysis. He further concluded that privacy may be one of the defining issues of a free society in the twenty-first century

Dynamic Planar Embeddings of Dynamic Graphs

We present an algorithm to support the dynamic embedding in the plane of a dynamic graph. An edge can be inserted across a face between two vertices on the face boundary (we call such a vertex pair linkable), and edges can be deleted. The planar embedding can also be changed locally by flipping components that are connected to the rest of the graph by at most two vertices. Given vertices $u,v$, linkable$(u,v)$ decides whether $u$ and $v$ are linkable in the current embedding, and if so, returns a list of suggestions for the placement of $(u,v)$ in the embedding. For non-linkable vertices $u,v$, we define a new query, one-flip-linkable$(u,v)$ providing a suggestion for a flip that will make them linkable if one exists. We support all updates and queries in O(log$^2 n$) time. Our time bounds match those of Italiano et al. for a static (flipless) embedding of a dynamic graph. Our new algorithm is simpler, exploiting that the complement of a spanning tree of a connected plane graph is a spanning tree of the dual graph. The primal and dual trees are interpreted as having the same Euler tour, and a main idea of the new algorithm is an elegant interaction between top trees over the two trees via their common Euler tour.Comment: Announced at STACS'1

Young children's interpersonal trust consistency as a predictor of future school adjustment

Young children’s interpersonal trust consistency was examined as a predictor of future school adjustment. One hundred and ninety two (95 male and 97 female, M age = 6 years 2 months, SD age = 6 months) children from school years 1 and 2 in the United Kingdom were tested twice over one-year. Children completed measures of peer trust and school adjustment and teachers completed the Short-Form Teacher Rating Scale of School Adjustment. Longitudinal quadratic relationships emerged between consistency of children’s peer trust beliefs and peer-reported trustworthiness and school adjustment and these varied according to social group, facet of trust, and indictor of school adjustment. The findings support the conclusion that interpersonal trust consistency, especially for secret-keeping, predicts aspects of young children’s school adjustment

Molecular diffusion between walls with adsorption and desorption

The time dependency of the diffusion coefficient of particles in porous media is an efficient probe of their geometry. The analysis of this quantity, measured e.g. by nuclear magnetic resonance (PGSE-NMR), can provide rich information pertaining to porosity, pore size distribution, permeability and surface-to-volume ratio of porous materials. Nevertheless, in numerous if not all practical situations, transport is confined by walls where adsorption and desorption processes may occur. In this article, we derive explicitly the expression of the time-dependent diffusion coefficient between two confining walls in the presence of adsorption and desorption. We show that they strongly modify the time-dependency of the diffusion coefficient, even in this simple geometry. We finally propose several applications, from sorption rates measurements to the use as a reference for numerical implementations for more complex geometries.Comment: 4 pages, 2 figures, 1 supplementary material of 3 page

Search for heavy antinuclei in the cosmic radiation

The existence of significant amounts of antimatter in the Universe is demonstrated through cosmic radiation. The data from the Danish-French Cosmic Ray Spectrometer on the HEAO-3 satellite offers an opportunity to search for heavy antinuclei, since all the relevant parameters (charge, velocity, arrival direction, and satellite position at the time of arrival) are measured for each recorded nucleus. Using the 22676 positive only events in the data seletion corresponding to L 1.5 as a measure of our exposure factor to heavy antinuclei and noting that no corresponding antinuclei were found, an upper limit (95% confidence) is given to the ratio of antinuclei to nuclei as 1.4 x .0001 for particles with Z 9. The upper limit resulting from this work is compared with previous results of searches for heavy antimatter in the cosmic radiation. It is seen that, if one regards only antiparticles heavier than fluorine, then the present result represents a reduced upper limit over previous data. When taken together, all the available experiment data now push the upper limit for the ratio of antiparticles to particles well below .0001