Commenced Publication in 1973 Founding and Former Series Editors: (2008)
Gerhard Goos, Juris Hartmanis, Jan Van Leeuwen, Editorial Board, David Hutchison, Takeo Kanade, ...
Abstract Enhancing Privacy and Trust in Electronic Communities (2008)
Bernardo A. Huberman, Matt Franklin, Tad Hogg
A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to nd groups of people that share...
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
Abstract. Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17]...
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji, Moti Yung
Abstract. Exposure of secret keys seems to be inevitable, and may in practice represent the most likely point of failure in a cryptographic system. Recently, the notion of intrusion-resilience [17]...
Matt Franklin, Tomas Sander, Intertrust Technologies
Abstract. In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the "market " for monetary influence in political...
A survey of key evolving cryptosystems (2006)
This paper presents a survey of key evolving cryptosystems in the public key setting, focusing on two main approaches: 'forward security' and 'intrusion resilience'. The essential feature of this...
A survey of key evolving cryptosystems (2006)
This paper presents a survey of key evolving cryptosystems in the public key setting, focusing on two main approaches: 'forward security' and 'intrusion resilience'. The essential feature of this...
A generic construction for intrusion-resilient public-key encryption (2004)
Yevgeniy Dodis, Matt Franklin, Jonathan Katz, Atsuko Miyaji
Abstract. In an intrusion-resilient cryptosystem [10], two entities (a user and a base) jointly evolve a secret decryption key; this provides very strong protection against an active attacker who can...
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...
Lower bounds for multicast message authentication (2001)
Dan Boneh, Glenn Durfee, Matt Franklin
Abstract. Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Identity-based encryption from the Weil pairing (2001)
Abstract. We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the...
Identity-based encryption from the Weil pairing (2001)
Abstract. We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the...
Cryptography as a Network Service (2001)
Tom Berson, Drew Dean, Matt Franklin, Diana Smetters, Michael Spreitzer
Cryptography is a powerful tool for building secure distributed systems, albeit at substantial computational cost. This is especially true for public key cryptography. Conventional wisdom dictates...
An algebraic approach to IP traceback (2001)
Drew Dean, Matt Franklin, Adam Stubblefield
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. This paper reframes the...
An algebraic approach to IP traceback (2001)
Drew Dean, Matt Franklin, Adam Stubblefield
We present a new solution to the problem of determining the path a packet traversed over the Internet (called the traceback problem) during a denial of service attack. Previous solutions to this...
Lower bounds for multicast message authentication (2001)
Abstract. Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Commital Deniable Proofs and Electronic Campaign Finance (2000)
Abstract. In a recent Stanford Law Review article, Ayres and Bulow [1] propose a radical anonymity-based solution to disrupt the “market ” for monetary influence in political campaigns. To...
Distribution chain security (2000)
Digital content distribution systems will enable business models in the near future that cannot be predicted today. In this paper, we identify a new security problem that can be crucial to this...
Distribution Chain Security (2000)
Digital content distribution systems will enable business models in the near future that cannot be predicted today. In this paper, we identify a new security problem that can be crucial to this...
Enhancing privacy and trust in electronic communities (1999)
Bernardo A. Huberman, Matt Franklin, Tad Hogg
A major impediment to using recommendation systems and collective knowledge for electronic commerce is the reluctance of individuals to reveal preferences in order to find groups of people that share...
Anonymous Authentication With Subset Queries (Extended Abstract) (1999)
) Dan Boneh Matt Franklin dabo@cs.stanford.edu franklin@parc.xerox.com Abstract We develop new schemes for anonymous authentication that support identity escrow. Our protocols also allow a prover to...
Secure Group Barter: Multi-Party Fair Exchange with Semi-Trusted Neutral Parties (1998)
The recent surge in popularity of e-commerce prompted a lot of activity in the area of electronic payments. Solutions have been developed for cash, credit card and check-based electronic...
Calandra, Stevie., Franklin, Matt., Ghaman, Roger., Roberts, Wes., Preuss, David., Bellini, Savino., ...
Presented by the Florida State University Motion Picture Conservatory.