An Analysis of Empirical PMF Based Tests For Least Significant Bit Image Steganography (2008)
Stark Draper, Prakash Ishwar, David Molnar, Vinod Prabhakaran, Daniel Schonberg, David Wagner
Abstract. We consider here the class of probability mass-function (PMF) based detectors of least significant bit (LSB) embedded steganography. That is, in this paper we investigate the use of...
APPROXIMATE MEASUREMENT OF VOTER PRIVACY LOSS IN AN ELECTION WITH PRECINCT REPORTS (2008)
Christopher Crutchfield, David Molnar, David Turner
Abstract. The California election process publishes tallies for each precinct as part of each county’s Statement of Vote. We take a data set from two California counties in the November 2004...
THE DISTRIBUTION OF JAGER PAIRS FOR CONTINUED FRACTION LIKE MAPPINGS OF THE INTERVAL (2008)
Certain ergodic, piecewise Möbius self-mappings of the unit interval, similar to the classical Gauss or Rényi maps, give rise to natural sequences of convergents pn/qn for every associated...
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
From Weak to Strong Watermarking (2008)
Abstract. The informal goal of a watermarking scheme is to “mark ” a digital object, such as a picture or video, in such a way that it is difficult for an adversary to remove the mark without...
An Analysis of Empirical PMF Based Tests For Least Significant Bit Image Steganography (2008)
Stark Draper, Prakash Ishwar, David Molnar, Vinod Prabhakaran, Daniel Schonberg, David Wagner
Abstract. We consider here the class of probability mass-function (PMF) based detectors of least significant bit (LSB) embedded steganography. That is, in this paper we investigate the use of...
An Analysis of Empirical PMF Based Tests For Least Significant Bit Image Steganography (2008)
Stark Draper, Prakash Ishwar, David Molnar, Vinod Prabhakaran, Daniel Schonberg, David Wagner
1 Introduction Steganography is the practice of hiding a message in a covertext. Figure 1 showsan example of least significant bit (LSB) image steganography. While the images appear the same, the...
An Analysis of Empirical PMF Based Tests For (2008)
Least Significant Bit, Stark Draper, Prakash Ishwar, David Molnar, Vinod Prabhakaran, Daniel Schonberg, ...
We consider here the class of probability mass-function (PMF) based detectors of least significant bit (LSB) embedded steganography.
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus eciency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
Robert Johnson, David Molnar, Dawn Song, David Wagner
Abstract. Privacy homomorphisms, encryption schemes that are also homomorphisms relative to some binary operation, have been studied for some time, but one may also consider the analogous problem of...
Balls-and-Bins Communication Scheduling for Wireless Multi-Hop Sensor Networks (2007)
David Molnar, Umesh Shankar, Terence Tong
We present a balls-and-bins approach to scheduling communication in monitoring applications of sensor networks. In monitoring applications, each node in a routing tree wishes to send a fixed number...
Catchconv: Symbolic execution and run-time type inference for integer conversion errors (2007)
David Alexander Molnar, David Molnar, David Wagner, David Wagner
personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the...
We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine. In this application, the record of votes must survive even an unexpected failure of the...
Generic on-line/off-line threshold signatures (2006)
Chris Crutchfield, David Molnar, David Turner, David Wagner
1 Introduction We present generic on-line/off-line threshold signatures to improve the perfor-mance of threshold signature schemes, and we show how to construct such signatures from existing...
Provably Secure Substitution of Cryptographic Tools (2006)
With the development of provable security techniques, cryptographers have seen tension arise between what is practical and what can be proven. In particular, the use of simulation to prove security...
David Molnar, Tadayoshi Kohno, Naveen Sastry, David Wagner
David Molnar UC Berkeley Tadayoshi Kohno UC San Diego Naveen Sastry UC Berkeley David Wagner UC Berkeley Abstract We enumerate requirements and give constructions for the vote storage unit of an...
Generic On-line/O-line Threshold Signatures (2006)
Chris Crutchfield David, David Molnar, David Turner, David Wagner
We present generic on-line/o#-line threshold signatures, in which the bulk of signature computation can take place "o#-line" during lulls in service requests [6]. Such precomputation can...
Provably Secure Substitution of Cryptographic Tools (2006)
Many cryptographic protocols secure against malicious players use specially designed cryptographic tools. Essentially, these special tools function much like less-expensive tools, but give extra...
From Weak to Strong Watermarking (2006)
Nicholas Hopper, David Molnar, David Wagner
The informal goal of a watermarking scheme is to "mark" a digital object, such as a picture or video, in such a way that it is di#cult for an adversary to remove the mark without destroying...
Generic on-line/off-line threshold signatures (2006)
Chris Crutchfield, David Molnar, David Turner, David Wagner
Abstract. We present generic on-line/off-line threshold signatures, in which the bulk of signature computation can take place “off-line ” during lulls in service requests [6]. Such precomputation...
We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine. In this application, the record of votes must survive even an unexpected failure of the...
We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine. In this application, the record of votes must survive even an unexpected failure of the...
David Molnar, Tadayoshi Kohno, Naveen Sastry, David Wagner
We enumerate requirements and give constructions for the vote storage unit of an electronic voting machine. In this application, the record of votes must survive even an unexpected failure of the...
David Molnar, Matt Piotrowski, David Schultz, David Wagner
Abstract. We introduce new methods for detecting control-flow side channel attacks, transforming C source code to eliminate such attacks, and checking that the transformed code is free of...
Security and Privacy Issues in E-passports (2005)
Ari Juels, David Molnar, David Wagner
Within the next year, travelers from dozens of nations may be carrying a new form of passport in response to a mandate by the United States government. The e-passport, as it is sometimes called,...
A Scalable, Delegatable Pseudonym Protocol (2005)
Enabling Ownership Transfer, David Molnar, David Wagner
The ability to link two di#erent sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the tag attached to it,...
David Molnar, Matt Piotrowski, David Schultz, David Wagner
We introduce new methods for detecting control-flow side channel attacks, transforming C source code to eliminate such attacks, and checking that the transformed code is free of control-flow side...
On-line/Off-line Threshold Signatures without Trusted Dealers (2005)
Chris Crutchfield, David Molnar, David Turner, David Wagner
We propose on-line/off-line threshold signature schemes, in which the bulk of signature computation can take place "off-line" during lulls in service requests [7]. Such precomputation can...
The Program Counter Security Model: (2005)
Automatic Detection And, David Molnar, Matt Piotrowski, David Schultz, David Wagner
We introduce new methods for detecting control-flow side channel attacks, transforming C source code to eliminate such attacks, and checking that the transformed code is free of control-flow side...
A Scalable, Delegatable Pseudonym Protocol (2005)
Enabling Ownership Transfer, David Molnar, David Wagner
David Molnar , Andrea Soppera , and David Wagner UC Berkeley, British Telecom, and UC Berkeley Abstract. The ability to link two di#erent sightings of the same Radio Frequency Identification (RFID)...
The Program Counter Security Model: Automatic Detection and (2005)
David Molnar, Matt Piotrowski, David Schultz, David Wagner
We introduce new methods for detecting control-flow side channel attacks, transforming C source code to eliminate such attacks, and checking that the transformed code is free of control-flow side...
David Molnar, Matt Piotrowski, David Schultz, David Wagner
Abstract. We introduce new methods for detecting control-flow side channel attacks, transforming C source code to eliminate such attacks, and checking that the transformed code is free of...
A scalable, delegatable pseudonym protocol enabling ownership transfer of RFID tags (2005)
Abstract. The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the tag attached...
Privacy For RFID Through Trusted Computing (2005)
privacy issues because it enables tracking of items and people possibly without their knowledge or consent. One of the biggest challenges for RFID technology is to provide privacy protection without...
Privacy For RFID Through Trusted Computing (2005)
privacy issues because it enables tracking of items and people possibly without their knowledge or consent. One of the biggest challenges for RFID technology is to provide privacy protection without...
A scalable, delegatable pseudonym protocol enabling ownership transfer of RFID tags (2005)
Abstract. The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the tag attached...
Privacy For RFID Through Trusted Computing (2005)
privacy issues because it enables tracking of items and people possibly without their knowledge or consent. One of the biggest challenges for RFID technology is to provide privacy protection without...
Privacy and Security in Library RFID (2004)
Issues Practices And, David Molnar, David Wagner
We expose privacy issues related to Radio Frequency Identification (RFID) in libraries, describe current deployments, and suggest novel architectures for library RFID. Libraries are a fast growing...
Privacy and security in library RFID: Issues, practices, and architectures (2004)
Many libraries are starting to tag every item in their collections with radio frequency identification (RFID) tags, raising patron privacy concerns. An RFID tag is a small, low-cost device that can...
Homomorphic signature schemes (2002)
Robert Johnson, David Molnar, Dawn Song, David Wagner
Abstract. Privacy homomorphisms, encryption schemes that are also homomorphisms relative to some binary operation, have been studied for some time, but one may also consider the analogous problem of...
Homomorphic signature schemes (2002)
Robert Johnson, David Molnar, Dawn Song, David Wagner
Abstract. Privacy homomorphisms, encryption schemes that are also homomorphisms relative to some binary operation, have been studied for some time, but one may also consider the analogous problem of...
A reputation system to increase MIX-net reliability (2001)
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
A reputation system to increase MIX-net reliability (2001)
Roger Dingledine, Michael J. Freedman, David Hopwood, David Molnar
Abstract. We describe a design for a reputation system that increases the reliability and thus efficiency of remailer services. Our reputation system uses a MIX-net in which MIXes give receipts for...
The Free Haven project: Distributed anonymous storage service (2000)
Roger Dingledine, Michael J. Freedman, David Molnar
We present a design for a system of anonymous storage which resists the attempts of powerful adversaries to find or destroy any stored data. We enumerate distinct notions of anonymity for each party...
The Free Haven project: Distributed anonymous storage service (2000)
Roger Dingledine, Michael J. Freedman, David Molnar
The Free Haven Project is a design for a system of anonymous storage which resists the attempts of powerful adversaries to nd or destroy stored data. We explicitly specify requirements for such a...
Master’s report: Privacy and Security In Two RFID Deployments, With New Methods for (2000)
David Molnar, Private Authentication, Rfid Pseudonyms, D. Molnar, T. Kohno, N. Sastry, ...
in an Election With Precinct Reports. ” NSF/NIST Voting Systems Performance Rating Workshop 2006.