Sara Miner, More Tim, Pevzner Alin Deutsch, Scott Baden, Paul Kube
For two years, we have been teaching a quarter-long compiler construction course where students implement an interpreter for a variant of the XML query language XQuery. Our goal is to motivate...
\Lambda
Composition and Eciency Tradeos for Forward-Secure Digital Signatures (2007)
Tal Malkin, Daniele Micciancio, Sara Miner
Forward-secure digital signatures, initially proposed by Anderson in CCS 97 and formalized by Bellare and Miner in Crypto 99, are signature schemes which enjoy the additional guarantee that a...
Self-healing key distribution with revocation (2002)
Sara Miner, Michael Malkin, Matt Franklin, U. C. Davis, Drew Dean, Jessica Staddon, ...
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying...
Forward-Secure Threshold Signature Schemes (2001)
Michel Abdalla, Sara Miner, Chanathip Namprempre
mabdalla,sminer,meaw¡
Forward-Secure Threshold Signature Schemes (2001)
Michel Abdalla, Sara Miner, Chanathip Namprempre
Abstract. We construct forward-secure threshold signature schemes. These schemes have the following property: even if more than the threshold number of players are compromised, it is not possible to...
Forward-Secure Threshold Signature Schemes (2001)
Michel Abdalla, Sara Miner, Chanathip Namprempre
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remains: it is not...
Graph-based authentication of digital streams (2001)
We consider the authentication of digital streams over a lossy network. The overall approach taken is graph-based, as this yields simple methods for controlling overhead, delay, and the ability to...
Forward-Secure Threshold Signature Schemes (2001)
Michel Abdalla, Sara Miner, Chanathip Namprempre
We construct forward-secure threshold signature schemes. These schemes have the following property: even if more than the threshold number of players are compromised, it is not possible to forge...
Forward-Secure Threshold Signature Schemes (2001)
CHANATHIP NAMPREMPRE We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security...
Graph-based authentication of digital streams (2001)
We consider the authentication of digital streams over a lossy network. The overall approach taken is graph-based, as this yields simple methods for controlling overhead, delay, and the ability to...
Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications (2000)
We investigate, in a concrete security setting, several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs). By analyzing the concrete complexity of the...
Forward Security in Threshold Signature Schemes (2000)
Michel Abdalla, Sara Miner, Chanathip Namprempre
We consider the usage of forward security with threshold signature schemes. This means that even if more than the threshold number of players are compromised, some security remains: it is not...
Michel Abdalla, Sara Miner, Chanathip Namprempre
fmabdalla,sminer,cnampremg
Optimizing Timetabling Solutions Using Graph Coloring (1995)
Sara Miner, Saleh Elmohamed, Hon W. Yau
A method using graph coloring was developed for optimizing solutions to the timetabling problem, specifically the example of scheduling courses at a university given fixed time and space constraints....
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the concrete complexity...
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the concrete complexity...
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the concrete complexity...