Coded Cooperative Data Exchange for a Secret Key

We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one, subject to the constraint that it remains private from an eavesdropper. Although the problems are closely related, we prove that secret key generation with fewest number of linear transmissions is NP-hard, while it is known that the analogous problem in traditional cooperative data exchange can be solved in polynomial time. In doing this, we completely characterize the best possible performance of linear coding schemes, and also prove that linear codes can be strictly suboptimal. Finally, we extend the single-key results to characterize the minimum number of public transmissions required to generate a desired integer number of statistically independent secret keys.Comment: Full version of a paper that appeared at ISIT 2014. 19 pages, 2 figure

Hadron structure after 25 years of QCD

We briefly review the status of our understanding of hadron structure based on QCD. This includes the role of symmetries, especially chiral symmetry, and the insights provided by lattice QCD. The main focus is on baryon structure and especially the nucleon, but this cannot be treated realistically without reference to spectroscopy. Our aim is to highlight recent insights and promising directions for future work.Comment: Invited talk presented at the 16th Int. Conf. on Few Body Problems (Taipei, March 6-10, 2000); 13 pages, 3 figure

Representability for some moduli stacks of framed sheaves

We prove a representability theorem for moduli functors of framed torsion-free sheaves on nonsingular complex projective surfaces, using formal geometry along a curve in the surface. This has as a consequence that a certain restriction morphism for moduli stacks of sheaves has fibers that are schemes.Comment: 6 pages, AMSLaTeX, substantially revised and shortened versio