See this document in CiteSeerX!

The Dual Receiver Cryptosystem and Its Applications (2004)  (Make Corrections)  
Theodore Diament, Homin K. Lee, Angelos D. Keromytis, Moti Yung
CCS'04



  Home/Search   Context   Related

 
View or download:
columbia.edu/~angelos/Paper...combo.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  columbia.edu/~angelos/cv (more)
Homepages:  A.Keromytis  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We put forth the notion of a dual receiver cryptosystem and implement it based on bilinear pairings over certain elliptic curve groups. The cryptosystem is simple and efficient yet powerful, as it solves two problems of practical importance whose solutions have proven to be elusive before: (1) A provably secure "combined" public-key cryptosystem (with a single secret key per user in space-limited environment) where the key is used for both decryption and signing and where encryption can be... (Update)

Active bibliography (related documents):   More   All
0.9:   Efficient, DoS-Resistant, Secure Key Exchange for.. - Aiello, Bellovin..   (Correct)
0.5:   DOS-resistant Authentication with Client Puzzles - Aura, Nikander, Leiwo (2000)   (Correct)
0.5:   Securing IPv6 Neighbor and Router Discovery - Arkko, Aura, al. (2002)   (Correct)

Similar documents based on text:   More   All
0.2:   The Price of Safety in an Active Network - Alexander, Anagnostakis.. (1999)   (Correct)
0.2:   Implementing IPsec - Keromytis, Ioannidis, Smith (1997)   (Correct)
0.2:   Resume - Alexander   (Correct)

BibTeX entry:   (Update)

@inproceedings{ diament04dual,
  author = "Theodore Diament and Homin K. Lee and Angelos D. Keromytis and Moti Yung",
  title = "The Dual Receiver Cryptosystem and Its Applications",
  booktitle = "CCS'04",
  year = "2004",
  url = "citeseer.ist.psu.edu/diament04dual.html" }
Citations (may not include all citations):
635   New directions in cryptography - Di and, Hellman - 1976
501   A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
404   Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
337   Identity-based encryption from the Weil pairing - Boneh, Franklin - 2001
307   Resilient Overlay Networks - Andersen, Balakrishnan et al. - 2001
193   Short signatures from the Weil pairing - Boneh, Lynn et al. - 2001
177   Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
131   Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Racko, Simon - 1991
108   A one-round protocol for tripartite Di#e-Hellman (context) - Joux - 2000
98   SOS: Secure Overlay Services - Keromytis, Misra et al. - 2002
78   Analysis of a Denial of Service Attack on TCP - Schuba, Krsul et al. - 1997
74   Photuris: Session-key management protocol (context) - Karn, Simpson - 1999
56   Hierarchical ID-based cryptography - Gentry, Silverberg - 2002
50   Separating Decision Di#e-Hellman from Di#e-Hellman in crypto.. - Joux, Nguyen - 2001
48   Implementing the Tate pairing (context) - Galbraith, Harrison et al. - 2002
48   REACT: Rapid enhanced-security asymmetric cryptosystem trans.. (context) - Okamoto, Pointcheval - 2002
42   Time-lock Puzzles and Timed-release Crypto - Rivest, Shamir et al. - 1996
41   Using Client Puzzles to Protect TLS (context) - Dean, Stubblefield - 2001
35   Denial of Service in Sensor Networks - Wood, Stankovic - 2002
33   Client puzzles: A cryptographic countermeasure against conne.. (context) - Juels, Brainard - 1999
29   The Internet Key Exchange (IKE). Request for Comments (Propo.. (context) - Harkins, Carrel - 1998
28   Memory-bound Functions (context) - Abadi, Burrow et al. - 2003
25   Escrow encryption systems visited: attacks (context) - Frankel, Yung - 1995
25   Trends in Denial of Service Attack Technology (context) - Houle, Weaver et al. - 2001
24   The Tate pairing and the discrete logarithm applied to ellip.. - Frey, Muller et al. - 1999
24   Attack Class: Address Spoofing (context) - Heberlein, Bishop - 1996
21   Timed Commitments (context) - Boneh, Naor - 2000
21   Proofs of Work and Bread Pudding Protocols - Jakobsson, Juels - 1999
21   The Weil and Tate pairings as building blocks for public key.. (context) - Joux - 2002
21   Evidence that XTR is more secure than supersingluar elliptic.. (context) - Verheul - 2001
19   Hashcash - A Denial of Service Counter-Measure - Back - 2002
14   Towards network denial of service resistant protocols - Leiwo, Nikander et al. - 2000
13   Network Security (context) - Kaufman, Perlman et al. - 2002
13   Defending Against Denial-of-Service Attacks with Puzzle Auct.. (context) - Wang, Reiter - 2003
10   Stateless connections - Aura, Nikander - 1997
10   Pricing via Processing (context) - Dwork, Naor - 1992
7   PayWord and MicroMint (context) - Rivest, Shamir - 1996
6   Protecting key exchange and management protocols against res.. - Oppliger - 1999
6   Timed Release of Standard Digital Signatures (context) - Garay, Jakobsson - 2002
6   Guaranteeing Access in Spite of Distributed Service-Flooding.. - Gligor - 2003
6   Scalability and flexibility in authentication services: the .. - Janson, Tsudik et al. - 1997
5   Personal communication (context) - Pinkas
5   Enhancing the resistance of a provably secure key agreement .. (context) - Hirose, Matsuura - 1999
3   SIFF: A Stateless Internet Flow Filter to Mitigate DDoS Floo.. - Yaar, Perrig et al. - 2004
3   Securely combining public-key cryptosystems - Haber, Pinkas - 2001
2   Supersingular abelian varieties in cryptography (context) - Rubin, Silverberg - 2002
1   dos-resistant secure key exchange for internet protocols (context) - Aiello, Bellovin et al. - 2002
1   Resisting SYN-flood DoS Attacks with a SYN Cache (context) - Lemmon - 2001
1   Thrshold cryptosystems secure against chosen-ciphertext atta.. (context) - Fouque, Pointcheval - 2001

Documents on the same site (http://www1.cs.columbia.edu/~angelos/cv.html):   More
Just Fast Keying: Key Agreement in a Hostile Internet - Aiello, Bellovin, Blaze.. (2004)   (Correct)
Automated Recovery in a Secure Bootstrap Process - Arbaugh, Keromytis, Farber.. (1998)   (Correct)
Requirements for Scalable Access Control and Security.. - Keromytis, Smith (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC