User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

One-time trapdoor one-way functions

Primary tabs

download
  • Open access
  • PDF
  • 323.82 K
Cathalo, Julien [UCL] Petit, Christophe [UCL]

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.

Document type Communication à un colloque (Conference Paper) – Présentation orale avec comité de sélection
Access type Accès libre
Publication date 2010
Language Anglais
Conference "Information Security - 13th International Conference (ISC 2010)", Boca Raton (FL, USA) (du 25/10/2010 au 28/10/2010)
Peer reviewed yes
Host document Mike Burmester and Gene Tsudik and Spyros S. Magliveras and Ivana Ilic ; "Proceedings of Informtion Security - 13th International Conference (ISC 2010)"- 15 pages (ISBN : 978-3-642-18177-1)
Publisher Springer
Publication status Publié
Affiliation UCL - SST/ICTM/ELEN - Pôle en ingénierie électrique
Keywords Cryptography ; Cryptographic primitive ; Trapdoor one-way function ; Fair exchange
Links
  1. Asokan N., Schunter Matthias, Waidner Michael, Optimistic protocols for fair exchange, 10.1145/266420.266426
  2. Asokan N., Shoup Victor, Waidner Michael, Optimistic fair exchange of digital signatures, Lecture Notes in Computer Science (1998) ISBN:9783540645184 p.591-606, 10.1007/bfb0054156
  3. Ateniese Giuseppe, Verifiable encryption of digital signatures and applications, 10.1145/984334.984335
  4. Bao Feng, An Efficient Verifiable Encryption Scheme for Encryption of Discrete Logarithms, Lecture Notes in Computer Science (2000) ISBN:9783540679233 p.213-220, 10.1007/10721064_19
  5. Bao, F., Deng, R.H., Mao, W.: Efficient and practical fair exchange protocols with off-line ttp. In: IEEE Symposium on Security and Privacy, pp. 77–85. IEEE Computer Society, Los Alamitos (1998)
  6. Bao Feng, Wang Guilin, Zhou Jianying, Zhu Huafei, Analysis and Improvement of Micali’s Fair Contract Signing Protocol, Information Security and Privacy (2004) ISBN:9783540223795 p.176-187, 10.1007/978-3-540-27800-9_16
  7. Bellare Mihir, Halevi Shai, Sahai Amit, Vadhan Salil, Many-to-one trapdoor functions and their relation to public-key cryptosystems, Advances in Cryptology — CRYPTO '98 (1998) ISBN:9783540648925 p.283-298, 10.1007/bfb0055735
  8. Ben-Or Michael, Goldreich Oded, Micali Silvio, Rivest Ronald L., A fair protocol for signing contracts, Automata, Languages and Programming ISBN:354015650X p.43-52, 10.1007/bfb0015729
  9. Boneh Dan, Gentry Craig, Lynn Ben, Shacham Hovav, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, Lecture Notes in Computer Science (2003) ISBN:9783540140399 p.416-432, 10.1007/3-540-39200-9_26
  10. Bürk Holger, Pfitzmann Andreas, Digital payment systems enabling security and unobservability, 10.1016/0167-4048(89)90022-9
  11. Camenisch Jan, Damgård Ivan, Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes, Advances in Cryptology — ASIACRYPT 2000 (2000) ISBN:9783540414049 p.331-345, 10.1007/3-540-44448-3_25
  12. Camenisch Jan, Shoup Victor, Practical Verifiable Encryption and Decryption of Discrete Logarithms, Advances in Cryptology - CRYPTO 2003 (2003) ISBN:9783540406747 p.126-144, 10.1007/978-3-540-45146-4_8
  13. Cathalo, J., Petit, C.: One-time trapdoor one-way functions (full version), http://www.dice.ucl.ac.be/~petit/files/ISC2010full.pdf
  14. Chen Liqun, Kudla Caroline, Paterson Kenneth G., Concurrent Signatures, Advances in Cryptology - EUROCRYPT 2004 (2004) ISBN:9783540219354 p.287-305, 10.1007/978-3-540-24676-3_18
  15. Damgård Ivan Bjerre, Practical and Provably Secure Release of a Secret and Exchange of Signatures, Advances in Cryptology — EUROCRYPT ’93 ISBN:9783540576006 p.200-217, 10.1007/3-540-48285-7_17
  16. Dodis Yevgeniy, Lee Pil Joong, Yum Dae Hyun, Optimistic Fair Exchange in a Multi-user Setting, Public Key Cryptography – PKC 2007 ISBN:9783540716761 p.118-133, 10.1007/978-3-540-71677-8_9
  17. Dodis, Y., Reyzin, L.: Breaking and repairing optimistic fair exchange from PODC 2003. In: Yung, M. (ed.) Digital Rights Management Workshop, pp. 47–54. ACM, New York (2003)
  18. Garay Juan A., Jakobsson Markus, MacKenzie Philip, Abuse-Free Optimistic Contract Signing, Advances in Cryptology — CRYPTO’ 99 (1999) ISBN:9783540663478 p.449-466, 10.1007/3-540-48405-1_29
  19. Gennaro Rosario, Micciancio Daniele, Rabin Tal, An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products, 10.1145/288090.288108
  20. Goldwasser, S., Micali, S.: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. In: STOC, pp. 365–377. ACM, New York (1982)
  21. Goldwasser Shafi, Micali Silvio, Rivest Ronald L., A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, 10.1137/0217017
  22. Huang Qiong, Yang Guomin, Wong Duncan S., Susilo Willy, Ambiguous Optimistic Fair Exchange, Advances in Cryptology - ASIACRYPT 2008 (2008) ISBN:9783540892540 p.74-89, 10.1007/978-3-540-89255-7_6
  23. Huang Qiong, Yang Guomin, Wong Duncan S., Susilo Willy, Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles, Topics in Cryptology – CT-RSA 2008 ISBN:9783540792628 p.106-120, 10.1007/978-3-540-79263-5_7
  24. Liu Jingwei, Sun Rong, Ma Wenping, Li Ying, Wang Xinmei, Fair Exchange Signature Schemes, 10.1109/waina.2008.51
  25. Lu Steve, Ostrovsky Rafail, Sahai Amit, Shacham Hovav, Waters Brent, Sequential Aggregate Signatures and Multisignatures Without Random Oracles, Advances in Cryptology - EUROCRYPT 2006 (2006) ISBN:9783540345466 p.465-485, 10.1007/11761679_28
  26. Mao Wenbo, Verifiable escrowed signature, Information Security and Privacy (1997) ISBN:9783540632320 p.240-248, 10.1007/bfb0027931
  27. Micali Silvio, Simple and fast optimistic protocols for fair electronic exchange, 10.1145/872035.872038
  28. Paillier Pascal, A Trapdoor Permutation Equivalent to Factoring, Public Key Cryptography (1999) ISBN:9783540656449 p.219-222, 10.1007/3-540-49162-7_17
  29. Park Jung Min, Chong Edwin K. P., Siegel Howard Jay, Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures, 10.1145/872035.872060
  30. Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical report, Cambridge, MA, USA (1979)
  31. Rivest R. L., Shamir A., Adleman L., A method for obtaining digital signatures and public-key cryptosystems, 10.1145/359340.359342
  32. Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387–394. ACM, New York (1990)
  33. Rückert Markus, Schröder Dominique, Security of Verifiably Encrypted Signatures and a Construction without Random Oracles, Pairing-Based Cryptography – Pairing 2009 (2009) ISBN:9783642032974 p.17-34, 10.1007/978-3-642-03298-1_2
  34. Zhang Jianhong, Mao Jian, A Novel Verifiably Encrypted Signature Scheme Without Random Oracle, Information Security Practice and Experience ISBN:9783540721598 p.65-78, 10.1007/978-3-540-72163-5_7
  35. Zhu Huafei, Bao Feng, Stand-Alone and Setup-Free Verifiably Committed Signatures, Topics in Cryptology – CT-RSA 2006 (2006) ISBN:9783540310334 p.159-173, 10.1007/11605805_11
Bibliographic reference Cathalo, Julien ; Petit, Christophe. One-time trapdoor one-way functions.Information Security - 13th International Conference (ISC 2010) (Boca Raton (FL, USA), du 25/10/2010 au 28/10/2010). In: Mike Burmester and Gene Tsudik and Spyros S. Magliveras and Ivana Ilic, Proceedings of Informtion Security - 13th International Conference (ISC 2010), Springer2010, p.15 pages
Permanent URL http://hdl.handle.net/2078.1/87907