One-time trapdoor one-way functions

Julien Cathalo; Christophe Petit

doi:10.1007/978-3-642-18178-8_25

One-time trapdoor one-way functions

Julien Cathalo^*, Christophe Petit

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Trapdoors are widely used in cryptography, in particular for digital signatures and public key encryption. In these classical applications, it is highly desirable that trapdoors remain secret even after their use. In this paper, we consider positive applications of trapdoors that do not remain secret when they are used. We introduce and formally define one-time trapdoor one-way functions (OTTOWF), a primitive similar in spirit to classical trapdoor one-way functions, with the additional property that its trapdoor always becomes public after use. We provide three constructions of OTTOWF. Two of them are based on factoring assumptions and the third one on generic one-way functions. We then consider potential applications of our primitive, and in particular the fair exchange problem. We provide two fair exchange protocols using OTTOWF, where the trapdoor is used to provide some advantage to one of the parties, whereas any (abusive) use of this trapdoor will make the advantage available to the other party as well. We compare our protocols with well-established solutions for fair exchange and describe some scenarios where they have advantageous characteristics. These results demonstrate the interest of one-time trapdoor one-way functions, and suggest looking for further applications of them.

Original language	English
Title of host publication	Information Security - 13th International Conference, ISC 2010, Revised Selected Papers
Publisher	Springer Verlag
Pages	283-298
Number of pages	16
ISBN (Print)	9783642181771
DOIs	https://doi.org/10.1007/978-3-642-18178-8_25
Publication status	Published - 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6531 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Bibliographical note

Funding Information:
★The work of this author was done while he was a post-doctoral researcher at the UCL Crypto Group and was supported by the Belgian Walloon Region under its RW-WIST Programme, ALAWN Project. ★★Research Fellow of the Belgian Fund for Scientific Research (F.R.S.-FNRS) at Universitécatholique de Louvain (UCL).

Keywords

Cryptographic primitive
fair exchange
trapdoor one-way function

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-18178-8_25

Cite this

Cathalo, J., & Petit, C. (2011). One-time trapdoor one-way functions. In Information Security - 13th International Conference, ISC 2010, Revised Selected Papers (pp. 283-298). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6531 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-18178-8_25

@inproceedings{a7d87ef7ad8b4651ab4c5890bd16d69e,

title = "One-time trapdoor one-way functions",

abstract = "Trapdoors are widely used in cryptography, in particular for digital signatures and public key encryption. In these classical applications, it is highly desirable that trapdoors remain secret even after their use. In this paper, we consider positive applications of trapdoors that do not remain secret when they are used. We introduce and formally define one-time trapdoor one-way functions (OTTOWF), a primitive similar in spirit to classical trapdoor one-way functions, with the additional property that its trapdoor always becomes public after use. We provide three constructions of OTTOWF. Two of them are based on factoring assumptions and the third one on generic one-way functions. We then consider potential applications of our primitive, and in particular the fair exchange problem. We provide two fair exchange protocols using OTTOWF, where the trapdoor is used to provide some advantage to one of the parties, whereas any (abusive) use of this trapdoor will make the advantage available to the other party as well. We compare our protocols with well-established solutions for fair exchange and describe some scenarios where they have advantageous characteristics. These results demonstrate the interest of one-time trapdoor one-way functions, and suggest looking for further applications of them.",

keywords = "Cryptographic primitive, fair exchange, trapdoor one-way function",

author = "Julien Cathalo and Christophe Petit",

note = "Funding Information: ★The work of this author was done while he was a post-doctoral researcher at the UCL Crypto Group and was supported by the Belgian Walloon Region under its RW-WIST Programme, ALAWN Project. ★★Research Fellow of the Belgian Fund for Scientific Research (F.R.S.-FNRS) at Universit{\'e}catholique de Louvain (UCL).",

year = "2011",

doi = "10.1007/978-3-642-18178-8_25",

language = "English",

isbn = "9783642181771",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "283--298",

booktitle = "Information Security - 13th International Conference, ISC 2010, Revised Selected Papers",

}

Cathalo, J & Petit, C 2011, One-time trapdoor one-way functions. in Information Security - 13th International Conference, ISC 2010, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6531 LNCS, Springer Verlag, pp. 283-298. https://doi.org/10.1007/978-3-642-18178-8_25

One-time trapdoor one-way functions. / Cathalo, Julien; Petit, Christophe.
Information Security - 13th International Conference, ISC 2010, Revised Selected Papers. Springer Verlag, 2011. p. 283-298 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6531 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - One-time trapdoor one-way functions

AU - Cathalo, Julien

AU - Petit, Christophe

N1 - Funding Information: ★The work of this author was done while he was a post-doctoral researcher at the UCL Crypto Group and was supported by the Belgian Walloon Region under its RW-WIST Programme, ALAWN Project. ★★Research Fellow of the Belgian Fund for Scientific Research (F.R.S.-FNRS) at Universitécatholique de Louvain (UCL).

PY - 2011

Y1 - 2011

N2 - Trapdoors are widely used in cryptography, in particular for digital signatures and public key encryption. In these classical applications, it is highly desirable that trapdoors remain secret even after their use. In this paper, we consider positive applications of trapdoors that do not remain secret when they are used. We introduce and formally define one-time trapdoor one-way functions (OTTOWF), a primitive similar in spirit to classical trapdoor one-way functions, with the additional property that its trapdoor always becomes public after use. We provide three constructions of OTTOWF. Two of them are based on factoring assumptions and the third one on generic one-way functions. We then consider potential applications of our primitive, and in particular the fair exchange problem. We provide two fair exchange protocols using OTTOWF, where the trapdoor is used to provide some advantage to one of the parties, whereas any (abusive) use of this trapdoor will make the advantage available to the other party as well. We compare our protocols with well-established solutions for fair exchange and describe some scenarios where they have advantageous characteristics. These results demonstrate the interest of one-time trapdoor one-way functions, and suggest looking for further applications of them.

AB - Trapdoors are widely used in cryptography, in particular for digital signatures and public key encryption. In these classical applications, it is highly desirable that trapdoors remain secret even after their use. In this paper, we consider positive applications of trapdoors that do not remain secret when they are used. We introduce and formally define one-time trapdoor one-way functions (OTTOWF), a primitive similar in spirit to classical trapdoor one-way functions, with the additional property that its trapdoor always becomes public after use. We provide three constructions of OTTOWF. Two of them are based on factoring assumptions and the third one on generic one-way functions. We then consider potential applications of our primitive, and in particular the fair exchange problem. We provide two fair exchange protocols using OTTOWF, where the trapdoor is used to provide some advantage to one of the parties, whereas any (abusive) use of this trapdoor will make the advantage available to the other party as well. We compare our protocols with well-established solutions for fair exchange and describe some scenarios where they have advantageous characteristics. These results demonstrate the interest of one-time trapdoor one-way functions, and suggest looking for further applications of them.

KW - Cryptographic primitive

KW - fair exchange

KW - trapdoor one-way function

UR - http://www.scopus.com/inward/record.url?scp=85037123072&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-18178-8_25

DO - 10.1007/978-3-642-18178-8_25

M3 - Conference contribution

AN - SCOPUS:85037123072

SN - 9783642181771

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 283

EP - 298

BT - Information Security - 13th International Conference, ISC 2010, Revised Selected Papers

PB - Springer Verlag

ER -

One-time trapdoor one-way functions

Abstract

Publication series

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this