Thomas Schweinberger, Victor Shoup  Home/Search
Context Related
| ibm.com/security/publi...SchSho2000.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/security/publicati...2000 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This document describes the Advanced Cryptographic Engine (ACE). It specifies a public key encryption scheme as well as a digital signature scheme with enough detail to ensure interoperability between different implementations. These schemes are almost as efficient as commercially used schemes, yet unlike such schemes, can be proven secure under reasonable and well-defined intractability assumptions. A concrete security analysis of both schemes is presented. (Update)
Context of citations to this paper: More
...Whirlpool. 8] Message authentication codes UMAC. 32] Two Track MAC. 67] Asymmetric encryption ACE KEM. [55] Upgrade of ACE Encrypt. EPOC. 19] Three distinct variants: EPOC 1, EPOC 2 and EPOC 3. ECIES. 28] PSEC. 18] Four distinct variants:...
Cited by: More
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006) (Correct)
Sequences of Games: A Tool for Taming Complexity in Security Proofs - Shoup (2004) (Correct)
The Game-Playing Technique - Bellare, Rogaway (2004) (Correct)
Similar documents (at the sentence level):
61.1%: ACE: The Advanced Cryptographic Engine - Schweinberger, Shoup (2000) (Correct)
Active bibliography (related documents): More All
0.5: Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (Correct)
0.4: A Proposal for an ISO Standard for Public Key Encryption - Shoup (2001) (Correct)
0.4: A Proposal for an ISO Standard for Public Key Encryption (version.. - Shoup (2001) (Correct)
Similar documents based on text: More All
0.6: Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999) (Correct)
0.5: Universal Hash Proofs and a Paradigm for Adaptive Chosen.. - Cramer, Shoup (2001) (Correct)
0.5: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
Related documents from co-citation: More All
6: Primitive submitted to NESSIE by RSA (context) - Jonsson, Kaliski et al. - 2000
6: A proposal for an ISO standard for public key encryption - Shoup
4: Primitive submitted to NESSIE (context) - Sergio, Barreto et al. - 2000
BibTeX entry: (Update)
T. Schweinberger and V. Shoup. ACE: The Advanced Cryptographic Engine. Manuscript, August 2000. Available from http://shoup.net/papers/. http://citeseer.ist.psu.edu/article/schweinberger00ace.html More
@techreport{ schweinberger00ace,
author = "Thomas Schweinberger and Victor Shoup",
title = "{ACE}: The Advanced Cryptographic Engine",
year = "2000",
url = "citeseer.ist.psu.edu/article/schweinberger00ace.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing e#cie.. - Bellare, Rogaway - 1993
635 New directions in cryptography - Di and, Hellman - 1976
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
411 How to prove yourself: practical solutions to identification.. - Fiat, Shamir - 1987
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
165 Security proofs for signature schemes - Pointcheval, Stern - 1996
165 Optimal asymmetric encryption - Bellare, Rogaway - 1994
161 Timing attacks on implementations of Di#e-Hellman (context) - Kocher - 1996
145 erential power analysis (context) - Kocher, Ja et al. - 1999
131 Noninteractive zero-knowledge proof of knowledge and chosen .. (context) - Racko, Simon - 1991
122 How to recycle random bits - Impagliazzo, Zuckermann - 1989
119 Chosen ciphertext attacks against protocols based on the RSA.. - Bleichenbacher - 1998
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996
105 Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi et al. - 1999
103 Statistical zero knowledge protocols to prove modular polyno.. (context) - Fujisaki, Okamoto - 1999
101 Collision-free accumulators and fail-stop signature schemes .. - Baric, Pfitzmann - 1997
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996
92 Signature schemes based on the strong RSA assumption - Cramer, Shoup - 1999
87 The Decision Di#e-Hellman Problem (context) - Boneh - 1998
86 How to protect DES against exhaustive key search - Kilian, Rogaway - 1996
65 Number-theoretic constructions of e#cient pseudo-random func.. - Naor, Reingold - 1997
63 Publicly verifiable secret sharing - Stadler - 1996
57 MARS--a candidate cipher for AES - Burwick, Coppersmith et al. - 1998
56 Collision free hash functions and public key signature schem.. (context) - Damgard - 1987
48 line electronic cash system based on the representation prob.. (context) - Brands, cient - 1993
45 LFSR-based hashing and authentication (context) - Krawczyk - 1994
40 Public-key encryption in a multiuser setting: security proof.. (context) - Bellare, Boldyreva et al. - 2000
39 Using hash functions as a hedge against chosen ciphertext at.. - Shoup - 2000
29 Finding collisions on a one-way street: can secure hash func.. (context) - Simon - 1998
28 The random oracle model (context) - Canetti, Goldreich et al. - 1998
27 Practical approaches to attaining security against adaptivel.. - Zheng, Seberry - 1992
25 the security of RSA padding - Coron, Naccache et al. - 1999
24 Why chosen ciphertext security matters - Shoup - 1998
22 Collisions for the compression function of MD - den Boer, Bosselaers - 1993
22 Fast construction of irreducible polynomials over finite fie.. - Shoup - 1994
21 Authentication and authenticated key exchange (context) - Di and, van Oorschot et al. - 1992
19 A composition theorem for universal one-way hash functions - Shoup - 2000
17 Handbook of Applied Cryptography (context) - Menesez, van Oorschot et al. - 1997
16 The status of MD5 after a recent attack (context) - Dobbertin - 1996
13 National Institute of Standards and Technology (context) - standard - 1995
13 Average case error estimates for the strong probable prime t.. (context) - Damgard, Landrock et al. - 1993
12 ISO 9796-1 and the new forgery strategy (context) - Coppersmith, Halevi et al. - 1999
10 Information-theoretic cryptography (context) - Maurer - 1999
6 DHAES: an encryption scheme based on the Di#e-Hellma problem (context) - Abdalla, Bellare et al. - 1998
5 The sum of PRPs is a secure PRF - Lucks - 2000
4 A tool for obtaining tighter security analyses of pseudorand.. - Bellare, Impagliazzo - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zurich.ibm.com/security/publications/2000.html): More
Efficient Anonymous Fingerprinting with Group Signatures.. - Camenisch (2000) (Correct)
Using EMV Smartcards for Internet Payments - Van Herreweghen, Wille (2000) (Correct)
Secure Anonymous Signature-Based Transactions - Van Herreweghen (2000) (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