Zeitschriften und Ausgaben

Volumen 80 (2021): Heft 3 (December 2021)

Volumen 79 (2021): Heft 2 (December 2021)

Volumen 78 (2021): Heft 1 (October 2021)

Volumen 77 (2020): Heft 1 (December 2020)

Volumen 76 (2020): Heft 1 (December 2020)
Real Functions, Dynamical Systems and their Applications

Volumen 75 (2020): Heft 1 (April 2020)
Applied Mathematics'19

Volumen 74 (2019): Heft 1 (December 2019)
Real Functons, Ideals, Measurable Functions, Functional Equations

Volumen 73 (2019): Heft 1 (August 2019)
Number Theory, Algebra and Cryptology '18

Volumen 72 (2018): Heft 1 (December 2018)

Volumen 71 (2018): Heft 1 (December 2018)

Volumen 70 (2017): Heft 1 (September 2017)

Volumen 69 (2017): Heft 1 (June 2017)

Volumen 68 (2017): Heft 1 (March 2017)
Special Heft: Real Functions ’16, Real Functions, Density Topologies, Porosity

Volumen 67 (2016): Heft 1 (September 2016)

Volumen 66 (2016): Heft 1 (June 2016)
Heft title: Applied Mathematics ’16

Volumen 65 (2016): Heft 1 (March 2016)
Real Functions '15 — Measure Theory, Real Functions, General Topology. Editors: J. Borsík, 2016.

Volumen 64 (2015): Heft 1 (September 2015)
Number Theory and Cryptology ’15

Volumen 62 (2015): Heft 1 (March 2015)
Special Heft Title: Real Functions ’14

Volumen 61 (2014): Heft 1 (December 2014)
Special Heft Title: Applied Mathematics ‘14

Volumen 60 (2014): Heft 1 (September 2014)
Special Heft Title: Cryptology ’14

Volumen 59 (2014): Heft 1 (June 2014)
Special Heft Title: Number Theory ‘14

Volumen 58 (2014): Heft 1 (March 2014)
Real Functions ‘13 Real Functions, Topology, Real and Functional Analysis, Locally Convex Spaces

Volumen 57 (2013): Heft 1 (December 2013)
Cryptology

Volumen 56 (2013): Heft 1 (November 2013)
Number Theory

Volumen 55 (2013): Heft 1 (August 2013)

Volumen 54 (2013): Heft 1 (April 2013)
Differential and Difference Equations and Applications ‘2012

Volumen 53 (2012): Heft 1 (December 2012)
TATRACRYPT ‘12

Volumen 52 (2012): Heft 1 (August 2012)

Volumen 51 (2012): Heft 1 (April 2012)
PROBASTAT ‘11

Volumen 50 (2011): Heft 1 (December 2011)
Applied Mathematics and Informatics

Volumen 49 (2011): Heft 1 (August 2011)
Real Functions ‘10

Volumen 48 (2011): Heft 1 (April 2011)
Differential and Difference Equations and Applications 2010

Volumen 47 (2010): Heft 1 (December 2010)
CCEC ‘09

Volumen 46 (2010): Heft 1 (August 2010)
Real Functions ‘09

Volumen 45 (2010): Heft 1 (April 2010)
NILCRYPT ‘10

Volumen 44 (2009): Heft 1 (December 2009)
Real Function ’08 Functional Equation, Measures, Integration and Harmonic Analysis

Volumen 43 (2009): Heft 1 (August 2009)
Differential and Difference Equations and Applications 2008

Volumen 42 (2009): Heft 1 (April 2009)
Real Function ‘07

Zeitschriftendaten
Format
Zeitschrift
eISSN
1338-9750
ISSN
1210-3195
Erstveröffentlichung
12 Nov 2012
Erscheinungsweise
3 Hefte pro Jahr
Sprachen
Englisch

Suche

Volumen 47 (2010): Heft 1 (December 2010)
CCEC ‘09

Zeitschriftendaten
Format
Zeitschrift
eISSN
1338-9750
ISSN
1210-3195
Erstveröffentlichung
12 Nov 2012
Erscheinungsweise
3 Hefte pro Jahr
Sprachen
Englisch

Suche

8 Artikel
Uneingeschränkter Zugang

On a family of preimage-resistant functions

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 1 - 13

Zusammenfassung

Abstract

In the present paper we define a new hash function, based on inhomogeneous polynomials. First we define a large family of polynomials over finite fields and we prove that the members of this family are nearly permutational polynomials. Then we define a subfamily of the above family, such that the elements in the subfamily are easy to evaluate. We prove that (working in a large enough finite field) finding a preimage by chance of such a function is computationally infeasible, and we mention that methods for solving the equation corresponding to the preimage problem for such polynomials are also out of reach.

Schlüsselwörter

  • hash function
  • collision
  • polynomials.
Uneingeschränkter Zugang

Security of signature schemes in the presence of key-dependent messages

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 15 - 29

Zusammenfassung

Abstract

In recent years, quite some progress has been made in understand- ing the security of encryption schemes in the presence of key-dependent plaintexts. Here, we motivate and explore the security of a setting, where an adversary against a signature scheme can access signatures on key-dependent messages.

We propose a way to formalize the security of signature schemes in the pres- ence of key-dependent signatures (KDS). It turns out that the situation is quite different from key-dependent encryption: already to achieve KDS-security under non-adaptive chosen message attacks, the use of a stateful signing algorithm is inevitable-even in the random oracle model. After discussing the connection be- tween key-dependent signing and forward security, we present a compiler to lift any EUF-CMA secure one-time signature scheme to a forward secure signature scheme offering KDS-CMA security.

Schlüsselwörter

  • signature scheme
  • key-dependent message
  • forward security.
Uneingeschränkter Zugang

Cryptographic aspects of real hyperelliptic curves

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 31 - 65

Zusammenfassung

Abstract

In this paper, we give an overview of cryptographic applications using real hyperelliptic curves. We review previously proposed cryptographic protocols and discuss the infrastructure of a real hyperelliptic curve, the mathematical structure underlying all these protocols. We then describe recent improvements to infrastructure arithmetic, including explicit formulas for divisor arithmetic in genus 2, and advances in solving the infrastructure discrete logarithm problem, whose presumed intractability is the basis of security for the related cryptographic protocols.

Schlüsselwörter

  • hyperelliptic curve
  • Jacobian
  • infrastructure
  • public-key cryptography
  • discrete logarithm.
Uneingeschränkter Zugang

Remarks on Gödel’s code as a hash function

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 67 - 80

Zusammenfassung

Schlüsselwörter

  • Gödel numbering function
  • hash function
  • integer relation algorithm
  • rational reconstruction.
Uneingeschränkter Zugang

Formal analysis of security protocols for wireless sensor networks

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 81 - 97

Zusammenfassung

Abstract

Design of security protocols is notoriously error-prone. For this reason, it is required to use formal methods to analyze their security properties. In the paper we present a formal analysis of the Canvas protocol. The Canvas protocol was developed by Harald Vogt and should provide data integrity inWireless Sensor Networks. However, Dieter Gollmann published an attack on the protocol. We consider the fallacy of the Canvas scheme in different models of the attacker and present a solution for correcting the scheme.We propose a formal model of the fixed Canvas protocol in the applied pi-calculus. This model includes a model of the network topology, communication channels, captured nodes, and capabilities of the attacker. Moreover, we formulate and analyze the data integrity property of the scheme in the semantic model of the applied pi-calculus. We prove that the fixed Canvas scheme, in the presence of an active adversary, provides data integrity of messages assuming that captured nodes are not direct neighbors in the communication graph of a sensor network. Finally, we discuss the applicability of the proposed formal model for analysis of other WSN security protocols.

Schlüsselwörter

  • security protocols
  • Wireless Sensor Networks
  • formal analysis
  • Dolev-Yao model of the attacker
  • data integrity
  • the applied pi-calculus.
Uneingeschränkter Zugang

Results of Ukrainian national public cryptographic competition

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 99 - 113

Zusammenfassung

Abstract

Five symmetric block ciphers were proposed to Ukrainian national public cryptographic competition. Developers used different methods for achiev- ing security and performance of the algorithms. An overview of proposed sym- metric block ciphers and results of their security analysis is given in this paper.

Schlüsselwörter

  • symmetric block cipher
  • Ukrainian national public cryptographic competition
  • Kalyna
  • ADE
  • Labyrinth
  • Mukhmor.
Uneingeschränkter Zugang

On chosen target forced prefix preimage resistance

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 115 - 135

Zusammenfassung

Abstract

In this paper we analyze the Chosen Target Forced Prefix (CTFP) preimage resistance security notion for hash functions firstly introduced in [Kelsey, J.-Kohno, T.: Herding hash functions and the Nostradamus attack, in: Advances in Cryptology-EUROCRYPT ’06, 25th Annual Internat. Conf. on the Theory and Appl. of Cryptographic Techniques (S. Vaudenay, ed.), St. Peters- burg, Russia, 2006, Lecture Notes in Comput. Sci., Vol. 4004, Springer-Verlag, Berlin, 2006, pp. 183-200]. We give a formal definition of this property in hash function family settings and work out all the implications and separations be- tween the CTFP preimage resistance and other standard notions of hash function security (preimage resistance, collision resistance, etc.). This paper follows the work of [Rogaway, P.-Shrimpton, T.: Cryptographic hash-function basics: Def- initions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance, in: Fast Software Encryption, 11th Interna- tional Workshop-FSE ’04 (B. Roy et al., eds.), Delhi, India, 2004, Lecture Notes in Comput. Sci., Vol. 3017, Springer-Verlag, Berlin, 2004, pp. 371-388], where they define seven basic notions of hash function security and examine all the relationships among these notions. We also define a new property for security of hash function families-always CTFP preimage resistance, which guarantees CTFP security for all the hash functions in the family.

Schlüsselwörter

  • hash function
  • chosen target forced prefix preimage resistance
  • provable security.
Uneingeschränkter Zugang

Corrigendum to secret sharing on infinite graphs

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 137 - 138

Zusammenfassung

Abstract

The proof of Claim 6.8 in the Appendix of [L. Csirmaz: Secret sharing on infinite graphs, Tatra Mt. Math. Publ. 41 (2008), 1-18] is incorrect. Here we give a new (and hopefully correct) proof.

Schlüsselwörter

  • secret sharing scheme
  • information theory
  • infinite graph
  • lattice.
8 Artikel
Uneingeschränkter Zugang

On a family of preimage-resistant functions

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 1 - 13

Zusammenfassung

Abstract

In the present paper we define a new hash function, based on inhomogeneous polynomials. First we define a large family of polynomials over finite fields and we prove that the members of this family are nearly permutational polynomials. Then we define a subfamily of the above family, such that the elements in the subfamily are easy to evaluate. We prove that (working in a large enough finite field) finding a preimage by chance of such a function is computationally infeasible, and we mention that methods for solving the equation corresponding to the preimage problem for such polynomials are also out of reach.

Schlüsselwörter

  • hash function
  • collision
  • polynomials.
Uneingeschränkter Zugang

Security of signature schemes in the presence of key-dependent messages

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 15 - 29

Zusammenfassung

Abstract

In recent years, quite some progress has been made in understand- ing the security of encryption schemes in the presence of key-dependent plaintexts. Here, we motivate and explore the security of a setting, where an adversary against a signature scheme can access signatures on key-dependent messages.

We propose a way to formalize the security of signature schemes in the pres- ence of key-dependent signatures (KDS). It turns out that the situation is quite different from key-dependent encryption: already to achieve KDS-security under non-adaptive chosen message attacks, the use of a stateful signing algorithm is inevitable-even in the random oracle model. After discussing the connection be- tween key-dependent signing and forward security, we present a compiler to lift any EUF-CMA secure one-time signature scheme to a forward secure signature scheme offering KDS-CMA security.

Schlüsselwörter

  • signature scheme
  • key-dependent message
  • forward security.
Uneingeschränkter Zugang

Cryptographic aspects of real hyperelliptic curves

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 31 - 65

Zusammenfassung

Abstract

In this paper, we give an overview of cryptographic applications using real hyperelliptic curves. We review previously proposed cryptographic protocols and discuss the infrastructure of a real hyperelliptic curve, the mathematical structure underlying all these protocols. We then describe recent improvements to infrastructure arithmetic, including explicit formulas for divisor arithmetic in genus 2, and advances in solving the infrastructure discrete logarithm problem, whose presumed intractability is the basis of security for the related cryptographic protocols.

Schlüsselwörter

  • hyperelliptic curve
  • Jacobian
  • infrastructure
  • public-key cryptography
  • discrete logarithm.
Uneingeschränkter Zugang

Remarks on Gödel’s code as a hash function

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 67 - 80

Zusammenfassung

Schlüsselwörter

  • Gödel numbering function
  • hash function
  • integer relation algorithm
  • rational reconstruction.
Uneingeschränkter Zugang

Formal analysis of security protocols for wireless sensor networks

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 81 - 97

Zusammenfassung

Abstract

Design of security protocols is notoriously error-prone. For this reason, it is required to use formal methods to analyze their security properties. In the paper we present a formal analysis of the Canvas protocol. The Canvas protocol was developed by Harald Vogt and should provide data integrity inWireless Sensor Networks. However, Dieter Gollmann published an attack on the protocol. We consider the fallacy of the Canvas scheme in different models of the attacker and present a solution for correcting the scheme.We propose a formal model of the fixed Canvas protocol in the applied pi-calculus. This model includes a model of the network topology, communication channels, captured nodes, and capabilities of the attacker. Moreover, we formulate and analyze the data integrity property of the scheme in the semantic model of the applied pi-calculus. We prove that the fixed Canvas scheme, in the presence of an active adversary, provides data integrity of messages assuming that captured nodes are not direct neighbors in the communication graph of a sensor network. Finally, we discuss the applicability of the proposed formal model for analysis of other WSN security protocols.

Schlüsselwörter

  • security protocols
  • Wireless Sensor Networks
  • formal analysis
  • Dolev-Yao model of the attacker
  • data integrity
  • the applied pi-calculus.
Uneingeschränkter Zugang

Results of Ukrainian national public cryptographic competition

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 99 - 113

Zusammenfassung

Abstract

Five symmetric block ciphers were proposed to Ukrainian national public cryptographic competition. Developers used different methods for achiev- ing security and performance of the algorithms. An overview of proposed sym- metric block ciphers and results of their security analysis is given in this paper.

Schlüsselwörter

  • symmetric block cipher
  • Ukrainian national public cryptographic competition
  • Kalyna
  • ADE
  • Labyrinth
  • Mukhmor.
Uneingeschränkter Zugang

On chosen target forced prefix preimage resistance

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 115 - 135

Zusammenfassung

Abstract

In this paper we analyze the Chosen Target Forced Prefix (CTFP) preimage resistance security notion for hash functions firstly introduced in [Kelsey, J.-Kohno, T.: Herding hash functions and the Nostradamus attack, in: Advances in Cryptology-EUROCRYPT ’06, 25th Annual Internat. Conf. on the Theory and Appl. of Cryptographic Techniques (S. Vaudenay, ed.), St. Peters- burg, Russia, 2006, Lecture Notes in Comput. Sci., Vol. 4004, Springer-Verlag, Berlin, 2006, pp. 183-200]. We give a formal definition of this property in hash function family settings and work out all the implications and separations be- tween the CTFP preimage resistance and other standard notions of hash function security (preimage resistance, collision resistance, etc.). This paper follows the work of [Rogaway, P.-Shrimpton, T.: Cryptographic hash-function basics: Def- initions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance, in: Fast Software Encryption, 11th Interna- tional Workshop-FSE ’04 (B. Roy et al., eds.), Delhi, India, 2004, Lecture Notes in Comput. Sci., Vol. 3017, Springer-Verlag, Berlin, 2004, pp. 371-388], where they define seven basic notions of hash function security and examine all the relationships among these notions. We also define a new property for security of hash function families-always CTFP preimage resistance, which guarantees CTFP security for all the hash functions in the family.

Schlüsselwörter

  • hash function
  • chosen target forced prefix preimage resistance
  • provable security.
Uneingeschränkter Zugang

Corrigendum to secret sharing on infinite graphs

Online veröffentlicht: 13 Nov 2012
Seitenbereich: 137 - 138

Zusammenfassung

Abstract

The proof of Claim 6.8 in the Appendix of [L. Csirmaz: Secret sharing on infinite graphs, Tatra Mt. Math. Publ. 41 (2008), 1-18] is incorrect. Here we give a new (and hopefully correct) proof.

Schlüsselwörter

  • secret sharing scheme
  • information theory
  • infinite graph
  • lattice.

Planen Sie Ihre Fernkonferenz mit Scienceendo