Follow
Jeroen van de Graaf
Jeroen van de Graaf
Professor de Ciência da Computação, Universidade Federal de Minas Gerais
Verified email at dcc.ufmg.br
Title
Cited by
Cited by
Year
Cryptographic distinguishability measures for quantum-mechanical states
CA Fuchs, J Van De Graaf
IEEE Transactions on Information Theory 45 (4), 1216-1227, 1999
7501999
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
D Chaum, JH Evertse, J Graaf
Workshop on the Theory and Application of of Cryptographic Techniques, 127-141, 1987
3881987
Multiparty computations ensuring privacy of each party’s input and correctness of the result
D Chaum, IB Damgård, J Graaf
Conference on the Theory and Application of Cryptographic Techniques, 87-119, 1987
3431987
Gradual and verifiable release of a secret
EF Brickell, D Chaum, IB Damgård, J Graaf
Conference on the Theory and Application of Cryptographic Techniques, 156-166, 1987
1941987
Committed oblivious transfer and private multi-party computation
C Crépeau, J Graaf, A Tapp
Annual International Cryptology Conference, 110-123, 1995
1931995
Demonstrating possession of a discrete logarithm without revealing it
D Chaum, JH Evertse, J Graaf, R Peralta
Conference on the Theory and Application of Cryptographic Techniques, 200-212, 1986
1811986
Security of quantum key distribution against all collective attacks
E Biham, M Boyer, G Brassard, J Van De Graaf, T Mor
Algorithmica 34 (4), 372-388, 2002
1242002
A simple and secure way to show the validity of your public key
J Graaf, R Peralta
Conference on the Theory and Application of Cryptographic Techniques, 128-134, 1987
1181987
Towards a formal definition of security for quantum protocols
J Van De Graaf
Université de Montréal, 1997
641997
Improving Helios with Everlasting Privacy Towards the Public.
D Demirel, J Van De Graaf, RS dos Santos Araújo
Evt/wote 12, 2012
512012
A verifiable voting protocol based on Farnel
R Araújo, RF Custódio, J Graaf
Towards Trustworthy Elections, 274-288, 2010
452010
Oblivious transfer based on the McEliece assumptions
R Dowsley, J Graaf, J Müller-Quade, ACA Nascimento
International Conference on Information Theoretic Security, 107-117, 2008
432008
Towards a publicly-verifiable mix-net providing everlasting privacy
J Buchmann, D Demirel, J Graaf
International Conference on Financial Cryptography and Data Security, 197-204, 2013
282013
A two-party protocol with trusted initializer for computing the inner product
R Dowsley, J Graaf, D Marques, ACA Nascimento
International Workshop on Information Security Applications, 337-350, 2010
282010
Prêt à voter providing everlasting privacy
D Demirel, M Henning, J Graaf, PYA Ryan, J Buchmann
International Conference on E-Voting and Identity, 156-175, 2013
252013
Unconditionally secure, universally composable privacy preserving linear algebra
B David, R Dowsley, J van de Graaf, D Marques, ACA Nascimento, ...
IEEE Transactions on Information Forensics and Security 11 (1), 59-73, 2015
222015
Secret ballot elections with unconditional integrity
D Chaum, PYA Ryan, P Vora
School of Computing Science Technical Report Series, 2007
222007
Voting With Unconditional Privacy by Merging PrÊt À Voter and PunchScan
J Van De Graaf
IEEE Transactions on Information Forensics and Security 4 (4), 674-684, 2009
212009
On the composability of statistically secure bit commitments
R Dowsley, J Graaf, J Müller-Quade, AC Nascimento
Journal of Internet Technology 14 (3), 509, 2013
172013
Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting
J Graaf
Towards Trustworthy Elections, 231-241, 2010
152010
The system can't perform the operation now. Try again later.
Articles 1–20