Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Zapiski Nauchnykh Seminarov POMI, 2002, Volume 293, Pages 39–58 (Mi znsl1675)  

This article is cited in 3 scientific papers (total in 3 papers)

On non-abelian homomorphic public-key cryptosystems

D. Yu. Grigor'eva, I. N. Ponomarenkob

a Institute of Mathematical Research of Rennes
b St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Full-text PDF (255 kB) Citations (3)
Abstract: We construct homomorphic cryptosystems being (secret) epimorphisms $f\colon G\to H$, where $G$, $H$ are (publically known) groups and $H$ is finite. A letter of a message to be encrypted is an element $h\in H$, while its encryption $g\in G$ is such that $f(g)=h$. A homomorphic cryptosystem allows one to perform computations (operating in a group $G$) with encrypted information (without knowing the original message over $H$).
In this paper certain homomorphic cryptosystems are constructed for the first time for non-abelian groups $H$ (earlier, homomorphic cryptosystems were known only in the Abelian case). In fact, we present such a system for any solvable (fixed) group $H$.
Received: 07.12.2002
English version:
Journal of Mathematical Sciences (New York), 2005, Volume 126, Issue 3, Pages 1158–1166
DOI: https://doi.org/10.1007/s10958-005-0077-3
Bibliographic databases:
UDC: 512.510
Language: Russian
Citation: D. Yu. Grigor'ev, I. N. Ponomarenko, “On non-abelian homomorphic public-key cryptosystems”, Computational complexity theory. Part VII, Zap. Nauchn. Sem. POMI, 293, POMI, St. Petersburg, 2002, 39–58; J. Math. Sci. (N. Y.), 126:3 (2005), 1158–1166
Citation in format AMSBIB
\Bibitem{GriPon02}
\by D.~Yu.~Grigor'ev, I.~N.~Ponomarenko
\paper On non-abelian homomorphic public-key cryptosystems
\inbook Computational complexity theory. Part~VII
\serial Zap. Nauchn. Sem. POMI
\yr 2002
\vol 293
\pages 39--58
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl1675}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1948824}
\zmath{https://zbmath.org/?q=an:1081.94027}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2005
\vol 126
\issue 3
\pages 1158--1166
\crossref{https://doi.org/10.1007/s10958-005-0077-3}
Linking options:
  • https://www.mathnet.ru/eng/znsl1675
  • https://www.mathnet.ru/eng/znsl/v293/p39
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:315
    Full-text PDF :92
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024