Helger Lipmaa's publications

I've been interested in differential cryptanalysis ([LM01], [Lip02c], [LWD04]), fast implementations ([Lip98], [AL00], [TLT02], [Lip02b]), electronic auctions ([LAN02] and [EL04]), oblivious transfer ([Lip03b], [Lip05]), privacy-preserving data-mining and RRT ([AJL04], [LL04], [GLLM04], [Lip05], [LLM05], [LLM06]), electronic voting ([EL05a], [EL05b]), digital signatures ([LWB05], [LLP05]), time-stamping and certificate revocation ([BLLV98], PhD thesis, [BLS00], [BLL00], [BLL02],[Lip02a]), foundations and zero-knowledge ([Lip03a], [Lip04]), public key cryptography, block cipher modes ([LRW00], [AAL06]). I've been interested also in fast algorithms in general ([LM01], [Lip02a]), in the analysis of algorithms ([Lip02a]) and in mechanism design ([EL04], [EL05a], [EL05b]).

Publications

2008
[dl08]	Giovanni Di Crescenzo and Helger Lipmaa. Succinct NP Proofs from An Extractability Assumption. In Arnold Beckmann, Costas Dimitracopoulos and Benedikt Löwe, editors, Computability in Europe, volume 5028 of Lecture Notes in Computer Science, pages 175--185, Athens, Greece, June 15--20, 2008. Springer-Verlag.
2007
[dlw07]	Philippe Dumas, Helger Lipmaa and Johan Wallén. Asymptotic Behaviour of A Non-Commutative Rational Series With a Nonnegative Linear Representation. Discrete Mathematics and Theoretical Computer Science, 9(1):247--274, October 2007.
[ll07]	Sven Laur and Helger Lipmaa. A New Protocol for Conditional Disclosure of Secrets And Its Applications. In Jonathan Katz and Moti Yung, editors, The Fifth International Conference on Applied Cryptography and Network Security (ACNS'07), volume 4521 of Lecture Notes in Computer Science, pages 207--225, Zhuhai, China, June 5--8, 2007. Springer-Verlag.
2006
[llm06]	Sven Laur, Helger Lipmaa and Taneli Mielikäinen. Cryptographically Private Support Vector Machines. In Lyle Ungar, Mark Craven, Dimitrios Gunopulos and Tina Eliassi-Rad, editors, The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2006, pages 618--624, Philadelphia, USA, August 20--23, 2006. ACM.
[aal06]	Ammar Alkassar, Elena Andreeva and Helger Lipmaa. SLC: Efficient Authenticated Encryption for Short Packets. In Jana Dittmann, editor, Sicherheit 2006: Sicherheit - Schutz und Zuverlässigkeit, Beiträge der 3. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.v. (GI), volume 77 of Lecture Notes in Informatics, pages 270--278, Magdeburg, Germany, February 20--22, 2006. Gesellschaft für Informatik e.v..
2005
[el05b]	Edith Elkind and Helger Lipmaa. Hybrid Voting Protocols and Hardness of Manipulation. In Xiaotie Deng and Dingzhu Du, editors, The 16th Annual International Symposium on Algorithms and Computation, ISAAC 2005, volume 3827 of Lecture Notes in Computer Science, pages 206--215, Sanya, Hainan, China, December 19--21, 2005. Springer-Verlag.
[llm05]	Sven Laur, Helger Lipmaa and Taneli Mielikäinen. Private Itemset Support Counting. In Sihan Qing, Wenbo Mao, Javier Lopez and Guilin Wang, editors, Information and Communications Security: 7th International Conference, ICICS 2005, volume 3783 of Lecture Notes in Computer Science, pages 97--111, Beijing, China, December 10--13, 2005. Springer-Verlag.
[llp05]	Yong Li, Helger Lipmaa and Dingyi Pei. On Delegatability of Four Designated Verifier Signatures. In Sihan Qing, Wenbo Mao, Javier Lopez and Guilin Wang, editors, Information and Communications Security: 7th International Conference, ICICS 2005, volume 3783 of Lecture Notes in Computer Science, pages 61--71, Beijing, China, December 10--13, 2005. Springer-Verlag.
[lip05]	Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Communication. In Jianying Zhou and Javier Lopez, editors, The 8th Information Security Conference (ISC'05), volume 3650 of Lecture Notes in Computer Science, pages 314--328, Singapore, September 20--23, 2005. Springer-Verlag.
[lwb05]	Helger Lipmaa, Guilin Wang and Feng Bao. Designated Verifier Signature Schemes: Attacks, New Security Notions and A New Construction. In Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi and Moti Yung, editors, The 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005, volume 3580 of Lecture Notes in Computer Science, pages 459--471, Lisboa, Portugal, July 11--15, 2005. Springer-Verlag.
[el05a]	Edith Elkind and Helger Lipmaa. Small Coalitions Cannot Manipulate Voting. In Andrew Patrick and Moti Yung, editors, Financial Cryptography and Data Security --- Ninth International Conference, volume 3570 of Lecture Notes in Computer Science, pages 285--297, Roseau, The Commonwealth Of Dominica, February 28--March 3, 2005. Springer-Verlag.
2004
[gllm04]	Bart Goethals, Sven Laur, Helger Lipmaa and Taneli Mielikäinen. On Private Scalar Product Computation for Privacy-Preserving Data Mining. In Choonsik Park and Seongtaek Chee, editors, The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), volume 3506 of Lecture Notes in Computer Science, pages 104--120, Seoul, Korea, December 2--3, 2004. Springer-Verlag. To appear.
[ll04]	Sven Laur and Helger Lipmaa. On Private Similarity Search Protocols. In Sanna Liimatainen and Teemupekka Virtanen, editors, Proceedings of the 9th Nordic Workshop on Secure IT Systems (NordSec 2004), pages 73--77, Espoo, Finland, November 4--5, 2004. ISBN 951-22-7348-9.
[lip04]	Helger Lipmaa. Statistical Zero-Knowledge Arguments: Theory and Practice. In 4th European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2004), Jyväskylä, Finland, July 24--28, 2004. Invited survey.
[ajl04]	Andris Ambainis, Markus Jakobsson and Helger Lipmaa. Cryptographic Randomized Response Techniques. In Feng Bao, Robert H. Deng and Jianying Zhou, editors, Public Key Cryptography 2004, volume 2947 of Lecture Notes in Computer Science, pages 425--438, Singapore, March 1--4, 2004. Springer-Verlag.
[el04]	Edith Elkind and Helger Lipmaa. Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. In Ari Juels, editor, Financial Cryptography - Eighth International Conference, volume 3110 of Lecture Notes in Computer Science, pages 117--131, Key West, FL, USA, February 9--12, 2004. Springer-Verlag.
[lwd04]	Helger Lipmaa, Johan Wallén and Philippe Dumas. On the Additive Differential Probability of Exclusive-Or. In Bimal Roy and Willi Meier, editors, Fast Software Encryption 2004, volume 3017 of Lecture Notes in Computer Science, pages 317--331, Delhi, India, February 5--7, 2004. Springer-Verlag.
2003
[lip03b]	Helger Lipmaa. Verifiable Homomorphic Oblivious Transfer and Private Equality Test. In Chi Sung Laih, editor, Advances on Cryptology --- ASIACRYPT 2003, volume 2894 of Lecture Notes in Computer Science, pages 416--433, Taipei, Taiwan, November 30--December 4, 2003. Springer-Verlag.
[lip03a]	Helger Lipmaa. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. In Chi Sung Laih, editor, Advances on Cryptology --- ASIACRYPT 2003, volume 2894 of Lecture Notes in Computer Science, pages 398--415, Taipei, Taiwan, November 30--December 4, 2003. Springer-Verlag.
2002
[lip02c]	Helger Lipmaa. On Differential Properties of Pseudo-Hadamard Transform and Related Mappings. In Alfred Menezes and Palash Sarkar, editors, INDOCRYPT 2002, volume 2551 of Lecture Notes in Computer Science, pages 48--61, Hyderabad, India, December 15--18, 2002. Springer-Verlag.
[lip02b]	Helger Lipmaa. Fast Software Implementations of SC2000. In Agnes Chan and Virgil Gligor, editors, Information Security Conference 2002, volume 2433 of Lecture Notes in Computer Science, pages 63--74, São Paulo, Brazil, September 30 --- October 2, 2002. Springer-Verlag.
[lip02a]	Helger Lipmaa. On Optimal Hash Tree Traversal for Interval Time-Stamping. In Agnes Chan and Virgil Gligor, editors, Information Security Conference 2002, volume 2433 of Lecture Notes in Computer Science, pages 357--371, São Paulo, Brazil, September 30 --- October 2, 2002. Springer-Verlag.
[tlt02]	Masahiko Takenaka, Helger Lipmaa and Naoya Torii. The Implementation of The Block Cipher SC2000 (III). In ISEC Technical group meeting, Tohoku University, Sendai, Japan, July 18--19, 2002. In Japanese.
[BLL02]	Ahto Buldas, Peeter Laud, and Helger Lipmaa. Eliminating Counterevidence with Applications to Accountable Certificate Management. Journal of Computer Security, 10(3):273--296, 2002. Note: Special issue for ACM CCS 2000. One of the three invited papers. Supersedes [BLL00].	RI
[lan02]	Helger Lipmaa, N. Asokan and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. In Matt Blaze, editor, Financial Cryptography 2002, volume 2357 of Lecture Notes in Computer Science, pages 85--101, Southampton Beach, Bermuda, March 11--14, 2002. Springer-Verlag.
2001
[lm01]	Helger Lipmaa and Shiho Moriai. Efficient Algorithms for Computing Differential Properties of Addition. In Mitsuru Matsui, editor, Fast Software Encryption: 8th International Workshop, FSE 2001, volume 2355 of Lecture Notes in Computer Science, pages 336--350, Yokohama, Japan, April 2--4, 2001. Springer-Verlag. ISBN 3-540-43869-6.
2000
[bll00]	Ahto Buldas, Peeter Laud and Helger Lipmaa. Accountable Certificate Management using Undeniable Attestations. In Sushil Jajodia and Pierangela Samarati, editors, 7th ACM Conference on Computer and Communications Security, pages 9--18, Athens, Greece, November 1--4, 2000. ACM Press. ISBN ACM ISBN 1-58113-203-4.
[lrw00]	Helger Lipmaa, Phillip Rogaway and David Wagner. Comments to NIST Concerning AES-modes of Operations: CTR-mode Encryption. In Symmetric Key Block Cipher Modes of Operation Workshop, Baltimore, Maryland, USA, October 20, 2000.
[AL00]	Kazumaro Aoki and Helger Lipmaa. Fast Implementations of AES Candidates. Third AES Candidate Conference, New York City, USA, 13--14 April 2000.	RI
[bls00]	Ahto Buldas, Helger Lipmaa and Berry Schoenmakers. Optimally Efficient Accountable Time-Stamping. In Yuliang Zheng and Hideki Imai, editors, Public Key Cryptography '2000, volume 1751 of Lecture Notes in Computer Science, pages 293--305, Melbourne, Australia, January 18--20, 2000. Springer-Verlag.
1998
[bllv98]	Ahto Buldas, Peeter Laud, Helger Lipmaa and Jan Villemson. Time-Stamping with Binary Linking Schemes. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO '98, 18th Annual International Cryptology Conference, volume 1462 of Lecture Notes in Computer Science, pages 486--501, Santa Barbara, CA, USA, August 23--27, 1998. Springer-Verlag. ISBN 3-540-64892-5.
[lip98]	Helger Lipmaa. IDEA: A Cipher for Muldimedia Architectures? In Stafford Tavares and Henk Meijer, editors, Selected Areas in Cryptography '98, volume 1556 of Lecture Notes in Computer Science, pages 253--268, Kingston, Canada, August 17--18, 1998. Springer-Verlag.

(Some) Workshops without publications

Preprints

The following papers or their revised versions are submitted or will shortly be submitted to different journals/conferences:

[KLLN0?]	Emilia Käsper, Sven Laur and Helger Lipmaa. XBlack-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds, submitted, 2006
[LLP0?]	Sven Laur and Helger Lipmaa. Consistent Adaptive Two-Party Computations, to be submitted, 2006

Thesis

1. Master thesis ``Survey on the communication complexity'', 1995 (in Estonian)
2. PhD thesis Secure and Efficient Time-Stamping Systems, University of Tartu, 1999.

Books

1. Vello Hanson, Ahto Buldas, Tarvi Martens, Helger Lipmaa, Arne Ansper, Viljar Tulit, "Infosüsteemide turve I. Turvarisk" Küberneetika AS, 1997, 125 pages ["Security of Information Systems I.", book, in Estonian] [also available on web, buy online]
2. Vello Hanson, Ahto Buldas, Tarvi Martens, Helger Lipmaa, Arne Ansper, Viljar Tulit, "Infosüsteemide turve II. Turbetehnoloogia" Küberneetika AS, 1998, 372 pages ["Security of Information Systems II", book, in Estonian, buy online]

Chapters in Books

Books: Editor

1. Helger Lipmaa, Heidi Pehu-Lehtonen, ``Mobile security : proceedings of the Helsinki Unversity of Technology Seminar on Network Security'', Fall 2000. Espoo, Helsinki University of Technology, 2000. [Entry at HUT library (search my name), seminar homepage (with papers online)]
2. Helger Lipmaa, Moti Yung, editors, ``Inscrypt 2006'', Volume 4318 of Lecture Notes in Computer Science, pages 27-41, Springer, December 2006.

Articles in popular media

1. Helger Lipmaa, "Turvalised virtuaalsed privaatvõrgud," Arvutimaailm 2/97, pp 6-7 ["Virtual Private Networks", a survey], 1997
2. Ahto Buldas, Helger Lipmaa, "Ajatemplid digitaaldokumentidel", Arvutimaailm 2/98, pp 45-47 ["Time-stamps on the digital documents", a technical survey]

Tutorials

1. Helger Lipmaa, Cryptographic Techniques in Privacy-Preserving Data Mining. Tutorial at ECML/PKDD 2006.

Surveys and Technical Reports

Cryptography eprint Archive:

2008/107	Helger Lipmaa. On Cryptocomputing with Log-Squared Communication And Sublinear Computation
2007/133	Helger Lipmaa. New Communication-Efficient Oblivious Transfer Protocols Based on Pairings.
2006/356	Emilia Käsper, Sven Laur and Helger Lipmaa. Black-Box Knowledge Extraction Revisited: Universal Approach with Precise Bounds
2006/198	Sven Laur, Helger Lipmaa and Taneli Mielikäinen. Cryptographically Private Support Vector Machines. (Short version published in KDD 2006)
2006/088	Sven Laur and Helger Lipmaa. Consistent Adaptive Two-Party Computations
2005/378	Sven Laur and Helger Lipmaa. Additive Conditional Disclosure of Secrets And Applications. (Final version published in ACNS 2007.)
2004/063	Helger Lipmaa. An Oblivious Transfer Protocol with Log-Squared Total Communication. (Final version published in ISC 2005.)
2003/105	Helger Lipmaa. On Diophantine Complexity and Statistical Zero-Knowledge Arguments. (Final version published in ASIACRYPT 2003.)
2003/027	Andris Ambainis, Markus Jakobsson, Helger Lipmaa. Cryptographic Randomized Response Techniques. (Final version published in PKC 2004.)
2003/021	Edith Elkind, Helger Lipmaa. Interleaving Cryptography and Mechanism Design: The Case of Online Auctions. (Final version published in FC 2004.)
2002/124	Helger Lipmaa. On Optimal Hash Tree Traversal for Interval Time-Stamping. (Final version published in ISC 2002)
2001/095	Helger Lipmaa and N. Asokan and Valtteri Niemi. Secure Vickrey Auctions without Threshold Trust. (Final version published in FC 2002)
2001/086	Helger Lipmaa. Statistical Zero-Knowledge Proofs from Diophantine Equations. (Superseded by eprint 2003/105)
2001/001	Helger Lipmaa, Shiho Moriai. Efficient Algorithms for Computing Differential Properties of Addition. (Final version published in FSE 2001)
2000/027	Ahto Buldas and Peeter Laud and Helger Lipmaa. Accountable Certificate Management using Undeniable Attestations. (Final version published in ACM CCS 2000)

This section is incomplete:

1. Ahto Buldas, Peeter Laud, Helger Lipmaa, Jan Villemson, "Ajatempli protokollid, turvavajadused ja tehnilised nõuded," Technical Report DO-LU-X-22-1297, Küberneetika AS, 1997, 46 pages ["Timestamp protocols, security needs and technical requirements". Written by the order of Estonian Informatics Centre for the work of committee preparing the legal use of electronic documents]
2. Ahto Buldas, Helger Lipmaa, "Digital Signatures, Timestamps and the corresponding Infrastructure", Küberneetika AS, Technical Report 1998-21, [ ps.gz] Jan 1998, 7 pages [See CiteSeer entry]
3. Helger Lipmaa, "AES Candidates: A Survey of Implementations", Technical Report. Available from the list of submissions to the AES2 conference NIST Webpage, 8 pages, 1999 [See CiteSeer entry]
4. Helger Lipmaa, "Security in On-Line Governance". Survey prepared under UNESCO project "Developing Telematics and Information Networks for On-Line Governance", June 1999. [URL]
5. Helger Lipmaa, Digital Signatures and Authentication, June 1999. Updated version of a module in "Security in On-Line Governance". [URL]
6. Helger Lipmaa, Oleg Mürk, ``E-valimiste realiseerimisvõimaluste analüüs'', 33 pp, 2001. In Estonian. [``An analysis of the possibility to organise e-voting''. Analysis ordered by Estonian Department of Justice. PDF (126KB)]

Presentations

See my CV. Some of the most important presentations (that do not have a corresponding publication):

• Helger Lipmaa. E-valimised --- krüptograafi vaatevinkel. (E-voting --- the viewpoint of a cryptographer.) Seminar of the E-Voting Project, Käsmu, Estonia, Aug 3 2003. [pdf]

Coauthors

1. Ammar Alkassar (Sirrix AG, Germany)
2. Andris Ambainis (Waterloo, Canada)
3. Elena Andreeva (KU Leuven, Belgium)
4. Kazumaro Aoki (NTT, Information Sharing Laboratory Group, Japan)
5. N. Asokan (Nokia, Finland)
6. Feng Bao (I2R, Singapore)
7. Ahto Buldas (Cybernetica AS/Tallinn Technical University/University of Tartu, Estonia)
8. Giovanni Di Crescenzo, Telcordia, USA
9. Philippe Dumas (INRIA, France)
10. Edith Elkind (Warwick, UK)
11. Bart Goethals (Antwerp, Belgium)
12. Markus Jakobsson (University of Indiana at Bloomington, USA)
13. Peeter Laud (University of Tartu/Cybernetica AS, Estonia)
14. Sven Laur (Helsinki University of Technology, Finland)
15. Yong Li (SKLOIS, GSCAS, China)
16. Taneli Mielikäinen (HIIT-BRU, Finland)
17. Shiho Moriai (NTT, Information Sharing Laboratory Group, Japan)
18. Dingyi Pei (SKLOIS, China)
19. Phillip Rogaway (UC Davis, Chiang Mai University; USA/Thailand)
20. Berry Schoenmakers (Eindhoven University of Technology, Netherlands)
21. Valtteri Niemi (Nokia, Finland)
22. Masahiko Takenaka, (Fujitsu Labs, Japan)
23. Naoya Torii, (Fujitsu Labs, Japan)
24. David Wagner (UC Berkeley, USA)
25. Johan Wallén (Helsinki University of Technology, Finland)
26. Guilin Wang (I2R, Singapore)
27. Jan Willemson (aka Jan Villemson) (Playtech/University of Tartu, Estonia)

Erdös Number: 3

There might several different chains of length 3. The first one of length 4 that I became aware of (early 2000) is: Helger Lipmaa -> Berry Schoenmakers -> Moti Yung -> Noga Alon -> Paul Erdös. The first one of length 3: Helger Lipmaa -> Andris Ambainis -> Leonard J. Schulman -> Paul Erdös.

You can check the updated information from the MR Collaboration Distance page.

Acceptance ratio

So how worthy is a conference? One (and certainly not the most important! Caveat: it might actually give very wrong impression about the level of conference: some conferences get much more 'obviously bad submissions' than others. Some conferences and workshops---e.g., FSE---are very good even if the acceptance ratio is not that high.) way to measure it is to calculate the ratio of acceptance there. I've done it for the conferences my own papers were accepted to. Sorted by acceptance ratio. Note also that during the last years, the number of submissions has gone up in all conferences.

• ISC 2005. 271 submitted, 33 accepted (+6 to student track). Ratio: 8.21.
• ICICS 2005. 235 submitted, 41 accepted. (2 papers)
• ASIACRYPT 2003. 188 submitted, 33 accepted. Ratio: 5.70. (2 papers)
• ISAAC 2005. 549 submitted, 112 accepted. Ratio: 4.90.
• ACM CCS 2000. 131 submitted, 28 accepted. Ratio: 4.68.
• FC 2004. 78 submitted, 17 accepted. Ratio: 4.59.
• Crypto '98. 144 papers submitted, 33 accepted. Ratio: 4.36.
• FC 2002. 74 submitted, 19 accepted. Ratio: 3.89.
• FC 2005. 92 submitted, 24 accepted. Ration: 3.84.
• PKC 2004. 106 submitted, 32 accepted. Ratio: 3.31.
• ICALP 2005 (Track C). 74 submitted, 24 accepted. Ratio: 3.08.
• FSE 2004. 75 submitted, 28 accepted. Ratio: 2.68.
• NordSec 2004. 49 submitted, 19 accepted. Ratio: 2.58.
• INDOCRYPT 2002. 75 submitted, 31 accepted. Ratio: 2.42.
• PKC 2000. 70 submitted, 31 accepted. Ratio: 2.26.
• ISC 2002. 82 submitted, 38 accepted. Ratio: 2.16. (2 papers)
• FSE 2001. 46 submitted, 27 accepted. Ratio: 1.70.
• AES 2000. 37 submitted, 24 accepted. Ratio: 1.54.
• SAC '98. 39 papers submitted, 26 accepted. Ratio: 1.5.

Impact factors according to citeseer. Includes crypto-related venues in top 400 (ranking updated 09.10.2004 but some papers added after that), with the number of papers I have there.

• 31. Journal of Computer Security 2.00 (top 2.53%) 1 paper (invited)
• 37. Journal of Cryptology: 1.97 (top 3.03%)
• 38. CSFW: 1.96 (top 3.11%)
• 49. ACM Conference on Computer and Communications Security: 1.82 (top 4.01%) 1 paper
• 60. AES Candidate Conference: 1.77 (top 4.91%) 1 paper
• 73. STOC: 1.69 (top 5.97%)
• 75. KDD: 1.68 (top 6.14%) 1 paper /* DM conference, papers on PPDM */
• 79. CRYPTO: 1.63 (top 6.47%) 1 paper
• 108. FOCS: 1.51 (top 8.84%)
• 110. SODA: 1.51 (top 9.00%)
• 134. IEEE Symposium on Security and Privacy: 1.39 (top 10.97%)
• 143. Fast Software Encryption: 1.35 (top 11.71%) 2 papers
• 151. Information Hiding: 1.30 (top 12.36%)
• 159. EUROCRYPT: 1.27 (top 13.02%)
• 173. ESORICS: 1.25 (top 14.16%)
• 187. CT-RSA: 1.22 (top 15.31%)
• 189. Financial Cryptography: 1.21 (top 15.47%) 3 papers
• 280. ASIACRYPT: 1.01 (top 22.93%) 2 papers
• 301. ICALP: 0.97 (top 24.65%)) 1 paper
• 371. PKC: 0.83 (top 30.38%) 2 papers

Citing

According to Scholar.Google, several of my publications are highly cited, and since Scholar is relatively incomplete, the actual citation index is probably (much) higher. My publications, ordered by non-self-citations, are, in the format citations=non-self-citations+self-citations (note that all publications are from 1998 or later, updated Nov 6 2006, Nov 20 2007 and Apr 7 2008):

71 -> 91 -> 94 [BLLV98]
19 -> 60 -> 70 [GLLM04]
36 -> 57 -> 64 [LRW00]
40 -> 54 -> 58 [AL00]
 ? -> 57 -> 57 [LAN02]
20 -> 53 -> 57 [Lip05] (ISC+TR)
37 -> 45 -> 48 [BLL00]
20 -> 30 -> 34 [LM01]
20 -> 28 -> 33 [Lip03:ASIACRYPT:SZKDE + 2001 TechReport]
22 -> 30 -> 31 [BLS00]
15 -> 28 -> 29 [BLL02]  /* not shown in Scholar when queried by my name */
 ? -> 27 -> 28 [Lip99 - PhD] /* not shown in SCholar when queried by my name */
14 -> 25 -> 28 [Lip03:ASIACRYPT:OT]
 ? -> 22 -> 27 [LWB05]
24 -> 27 -> 26 [Lip98]
 3 -> 12 -> 22 [EL05:ISAAC]
 
 // H-index: 16
 
 6 -> 12 -> 14 [EL05:FC]
 ? -> 10 -> 12 [LWD04]
 9 -> 11 -> 11 [AJL04]
 5 ->  4 -> 11 [LL07]
 9 ->  7 -> 10 [Lip99] (Survey, TR)
 4 ->  6 ->  8 [Lip02:INDOCRYPT]
 4 ->  5 ->  6 [Lip02:ISC:TS]
 4 ->  4 ->  4 [Lip02:ISC:SC2000]
 2 ->  4 ->  4 [EL04]
 1 ->  3 ->  4 [LLM05]
 1 ->  2 ->  4 [LLM06]
 3 ->  3 ->  3 [BL98] (TR)
 ? ->  2 ->  3 [LLP05]
 2 ->  2 ->  2 [LL04]
 1 ->  1 ->  1 [TLT02]
         ->  1 [Lip06] - voting book chapter
...

For record, entries in the ISI database are worse than in Scholar.Google. The most annoying fact is that for certain publications, only the first author gets a reference. Moreover, they do not store for example ACM and IEEE publications, which means that [BLL00] and [BLL02] are not in the database, nor are many papers on ACM/IEEE conferences and journals that cite my papers.

My entries in:

• DBLP database (outdated, incomplete)
• Researchindex (incomplete by design, updated in every 2-3 months)
• HUT publication database (includes only publications while working at HUT, outdated)
• TCS@HUT publication database (includes only publications while working at HUT)

Send you inqueries to <h.lipmaa>">cs.ucl.ac.uk.