On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper we discuss the relation between a one-way group homomorphism and a one-way ring homomorphism. Let U, V be finite abelian groups with #U=n. We show that if there exists a one-way group homomorphism f:U→V, then there exists a one-way ring homomorphism F:Z_n⨁U→Z_n⨁Im f. We also give examples of such ring homomorphisms which are one-way under a standard cryptographic assumption. This implies that there is an affirmative solution to an extended version of the open question raised by Feigenbaum and Merrit: Is there an encryption function f such that both f(x+y) and f(x+y) can be efficiently computed from f(x) and f(y)? A multiple signature scheme is also given as an application of one-way ring homomorphisms.

• 社団法人電子情報通信学会の論文
• 1996-01-25

著者

• Nishizeki Takao

  Graduate School Of Information Sciences Tohoku University

• Nishizeki Takao

  Graduate School Of Information Sciences

• CHIDA Eikoh

  Graduate School of Information Sciences, Tohoku University

• OHMORI Motoji

  Information and Communications Technology Laboratory, Matsushita Electric Industrial Co., LTD.

• SHIZUYA Hiroki

  Graduate School of Information Sciences, Tohoku University

• Chida E

  Ichinoseki National Coll. Technol. Ichinoseki‐shi Jpn

• Chida Eikoh

  Graduate School Of Information Sciences Tohoku University

• Ohmori M

  Matsushita Electric Industrial Co. Ltd. Kadoma‐shi Jpn

• Shizuya Hiroki

  Graduate School Of Information Sciences Tohoku University

関連論文

• List Edge-Colorings of Series-Parallel Graphs
• Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
• Quantum Card Dealing
• Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
• Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
• Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
• 平面グラフの格子短形描画
• On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
• Cost Total Colorings of Trees(Foundations of Computer Science)
• LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
• LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
• Edge-Coloring Problems for Graphs
• Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
• Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
• Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
• Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
• Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
• Efficient Compression of Web Graphs
• Generalized Edge-Rankings of Trees
• One-Way Functions over Finite Near-Rings
• Digital Money–A Survey
• A Way of Making Trapdoor One-Way Functions Trapdoor No-Way : Special Section on Cryptography and Information Security
• Distributed Construction of Trust Anchor with the Hyper-Powering Signature Scheme
• The RSA Group Is Adaptive Pseudo-Free under the RSA Assumption
• Distributed Construction of Trust Anchor with the Hyper-Powering Signature Scheme

もっと見る 閉じる

スポンサーリンク