time dependant

2000-03-07 Thread Arrianto Mukti Wibowo
Hi, I want to know whether there is a crypto building block which doesn't allow someone to open an encrypted message before a certain date. [Damn hard. Math functions don't grok "date". The only reasonable way to do this without a trusted third party is to pick an encryption algorithm that will

proxy signatures

2000-02-25 Thread Arrianto Mukti Wibowo
Hi... I'm a research student studying crypto (newbies). I really need a paper, which I can not get: Masahiro Mambo, Usada Eiji Okamoto "Proxy Signatures" Proceedings of the 1995 Symposium on Cryptography and Information Security (SCIS 95), Inuyama, Japan, 24-27 Jan 1995. I've mailed two of

financial crypto - like conferences

2000-02-08 Thread Arrianto Mukti Wibowo
Hi... I need to know, whether any of you know any other financial-crypto-like international conferences at the second half of this year. I want to submit several of my papers, and I can't wait for FC 2001. The conference need not to be very theorethical or very prestigious, preferably a little

milis or newsgroup on financial crypto

1999-12-24 Thread Arrianto Mukti Wibowo
Hello, Does anybody know any mailing list or newsgroup for people whose interested in financial cryptography, especially e-cash? Sincerely, -mukti Check out my homepage: www.geocities.com/SiliconValley/8972 biodata, resumes, hobby, words of wisdom

why q|(p-1) in DLP protocols

1999-12-14 Thread Arrianto Mukti Wibowo
Hi professors... I'm a student studying cryptography and e-cash. I've been wondering, why many cryptographic protocols based on discrete log problem such as Schnorr, Brand's e-cash, Chaum Pedersen's DLP blind signature, etc, we must choose a prime q p where q divides (p-1)? q is the