( en | de | ru )

 

Disambiguation of "Ohta, Kazuo"

Author of the publication

copydeleteadd this publication to your clipboard
More Efficient Two-Round Multi-Signature Scheme with Provably Secure Parameters.

, , , , and . IACR Cryptol. ePrint Arch., (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Yusuke Ohta

Kazuo Inoue

Kazuo Okohira

Kazuo Yajima

Kazuo Araki

 

Other publications of authors with the same name

How to Simultaneously Exchange Secrets by General Assumptions., and . ACM Conference on Computer and Communications Security, page 184-192. ACM, (1994)Universally Composable NBAC-Based Fair Voucher Exchange for Mobile Environments., , , and . IWSEC (Short Papers), page 42-59. Information Processing Society of Japan (IPSJ), (2010)Tight correlations between forest parameters and backscattering coefficient derived by the L-band airborne SAR (PiSAR)., , , , , , , and . IGARSS, page 2340-2343. IEEE, (2004)Three-Subset Meet-in-the-Middle Attack on Reduced XTEA., , , , and . AFRICACRYPT, volume 7374 of Lecture Notes in Computer Science, page 138-154. Springer, (2012)New Message Difference for MD4., , , and . FSE, volume 4593 of Lecture Notes in Computer Science, page 329-348. Springer, (2007)Bit-Free Collision: Application to APOP Attack., , , and . IWSEC, volume 5824 of Lecture Notes in Computer Science, page 3-21. Springer, (2009)Rigorous Security Requirements for Designated Verifier Signatures., , and . Inscrypt, volume 6584 of Lecture Notes in Computer Science, page 318-335. Springer, (2010)Secure (M+1) st-Price Auction with Automatic Tie-Break., , , and . INTRUST, volume 9473 of Lecture Notes in Computer Science, page 422-437. Springer, (2014)Reset Indifferentiability from Weakened Random Oracle Salvages One-Pass Hash Functions., , and . ACNS, volume 8479 of Lecture Notes in Computer Science, page 235-252. Springer, (2014)Four Cards Are Sufficient for a Card-Based Three-Input Voting Protocol Utilizing Private Permutations., , , and . ICITS, volume 10681 of Lecture Notes in Computer Science, page 153-165. Springer, (2017)