Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks

Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sharmila Deva Selvi, S., Sree Vivek, S., Karuturi, N.N., Gopalakrishnan, R., Chandrasekaran, P.R.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 120
container_issue
container_start_page 109
container_title
container_volume
creator Sharmila Deva Selvi, S.
Sree Vivek, S.
Karuturi, N.N.
Gopalakrishnan, R.
Chandrasekaran, P.R.
description Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.'s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three.
doi_str_mv 10.1109/PST.2008.29
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4641278</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4641278</ieee_id><sourcerecordid>4641278</sourcerecordid><originalsourceid>FETCH-LOGICAL-i212t-6d21e9f7526e5644aac28663e5851500bbd80b3f8b527d4cfcc4015a102b50a73</originalsourceid><addsrcrecordid>eNotjEFLwzAYQAMy0M2dPHrJTT20fkmbpDmunbrBUKETjyNNv7q4bhlJQfbvZejpwYP3CLlhkDIG-vG9XqccoEi5viBjUFKLLNMgR2R81jrjTPFLMo3xGwCYlopJuCK7KpyOgzmY_hRdpL6jpd86T3Ggpk_vIl3Ok9JEbGkZvGmtiQOt3dfBnjPnD_R-WZZ19UBru8U90s4H-ukC9hgjnbXJwlv6isOPD7t4TUad6SNO_zkhH89P62qRrN5eltVslTjO-JDIljPUnRJcopB5bozlhZQZikIwAdA0bQFN1hWN4KrNbWdtDkwYBrwRYFQ2Ibd_X4eIm2NwexNOm1zmjKsi-wW0GlWD</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Sharmila Deva Selvi, S. ; Sree Vivek, S. ; Karuturi, N.N. ; Gopalakrishnan, R. ; Chandrasekaran, P.R.</creator><creatorcontrib>Sharmila Deva Selvi, S. ; Sree Vivek, S. ; Karuturi, N.N. ; Gopalakrishnan, R. ; Chandrasekaran, P.R.</creatorcontrib><description>Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.'s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three.</description><identifier>ISBN: 0769533906</identifier><identifier>ISBN: 9780769533902</identifier><identifier>DOI: 10.1109/PST.2008.29</identifier><identifier>LCCN: 2008932172</identifier><language>eng</language><publisher>IEEE</publisher><subject>Ad hoc networks ; Bilinear Pairing ; Broadcast Encryption ; Cryptanalysis ; Cryptography ; Games ; ID-Based Cryptography ; Polynomials ; Probabilistic logic ; Public key ; Security ; Signcryption</subject><ispartof>2008 Sixth Annual Conference on Privacy, Security and Trust, 2008, p.109-120</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4641278$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4641278$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sharmila Deva Selvi, S.</creatorcontrib><creatorcontrib>Sree Vivek, S.</creatorcontrib><creatorcontrib>Karuturi, N.N.</creatorcontrib><creatorcontrib>Gopalakrishnan, R.</creatorcontrib><creatorcontrib>Chandrasekaran, P.R.</creatorcontrib><title>Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks</title><title>2008 Sixth Annual Conference on Privacy, Security and Trust</title><addtitle>PST</addtitle><description>Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.'s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three.</description><subject>Ad hoc networks</subject><subject>Bilinear Pairing</subject><subject>Broadcast Encryption</subject><subject>Cryptanalysis</subject><subject>Cryptography</subject><subject>Games</subject><subject>ID-Based Cryptography</subject><subject>Polynomials</subject><subject>Probabilistic logic</subject><subject>Public key</subject><subject>Security</subject><subject>Signcryption</subject><isbn>0769533906</isbn><isbn>9780769533902</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjEFLwzAYQAMy0M2dPHrJTT20fkmbpDmunbrBUKETjyNNv7q4bhlJQfbvZejpwYP3CLlhkDIG-vG9XqccoEi5viBjUFKLLNMgR2R81jrjTPFLMo3xGwCYlopJuCK7KpyOgzmY_hRdpL6jpd86T3Ggpk_vIl3Ok9JEbGkZvGmtiQOt3dfBnjPnD_R-WZZ19UBru8U90s4H-ukC9hgjnbXJwlv6isOPD7t4TUad6SNO_zkhH89P62qRrN5eltVslTjO-JDIljPUnRJcopB5bozlhZQZikIwAdA0bQFN1hWN4KrNbWdtDkwYBrwRYFQ2Ibd_X4eIm2NwexNOm1zmjKsi-wW0GlWD</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Sharmila Deva Selvi, S.</creator><creator>Sree Vivek, S.</creator><creator>Karuturi, N.N.</creator><creator>Gopalakrishnan, R.</creator><creator>Chandrasekaran, P.R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200810</creationdate><title>Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks</title><author>Sharmila Deva Selvi, S. ; Sree Vivek, S. ; Karuturi, N.N. ; Gopalakrishnan, R. ; Chandrasekaran, P.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i212t-6d21e9f7526e5644aac28663e5851500bbd80b3f8b527d4cfcc4015a102b50a73</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Ad hoc networks</topic><topic>Bilinear Pairing</topic><topic>Broadcast Encryption</topic><topic>Cryptanalysis</topic><topic>Cryptography</topic><topic>Games</topic><topic>ID-Based Cryptography</topic><topic>Polynomials</topic><topic>Probabilistic logic</topic><topic>Public key</topic><topic>Security</topic><topic>Signcryption</topic><toplevel>online_resources</toplevel><creatorcontrib>Sharmila Deva Selvi, S.</creatorcontrib><creatorcontrib>Sree Vivek, S.</creatorcontrib><creatorcontrib>Karuturi, N.N.</creatorcontrib><creatorcontrib>Gopalakrishnan, R.</creatorcontrib><creatorcontrib>Chandrasekaran, P.R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sharmila Deva Selvi, S.</au><au>Sree Vivek, S.</au><au>Karuturi, N.N.</au><au>Gopalakrishnan, R.</au><au>Chandrasekaran, P.R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks</atitle><btitle>2008 Sixth Annual Conference on Privacy, Security and Trust</btitle><stitle>PST</stitle><date>2008-10</date><risdate>2008</risdate><spage>109</spage><epage>120</epage><pages>109-120</pages><isbn>0769533906</isbn><isbn>9780769533902</isbn><abstract>Broadcast signcryption enables the broadcaster to simultaneously encrypt and sign the content meant for a specific set of users in a single logical step. It provides a very efficient solution to the dual problem of achieving confidentiality and authentication during content distribution. Among other alternatives, ID-based schemes are arguably the best suited for its implementation in wireless ad-hoc networks because of the unique advantage that they provide - any unique, publicly available parameter of a user can be his public key, which eliminates the need for a complex public key infrastructure. In 2004, Bohio et al. proposed an ID-based broadcast signcryption (IBBSC) scheme which achieves constant ciphertext size. They claim that their scheme provides both message authentication and confidentiality, but do not give formal proofs. In this paper, we demonstrate how a legitimate user of the scheme can forge a valid signcrypted ciphertext, as if generated by the broadcaster. Moreover, we show that their scheme is not IND-CCA secure. Following this, we propose a fix for Bohio et al.'s scheme, and formally prove its security under the strongest existing security models for broadcast signcryption (IND-CCA2 and EUF-CMA). While fixing the scheme, we also improve its efficiency by reducing the ciphertext size to two elements compared to three.</abstract><pub>IEEE</pub><doi>10.1109/PST.2008.29</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769533906
ispartof 2008 Sixth Annual Conference on Privacy, Security and Trust, 2008, p.109-120
issn
language eng
recordid cdi_ieee_primary_4641278
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Ad hoc networks
Bilinear Pairing
Broadcast Encryption
Cryptanalysis
Cryptography
Games
ID-Based Cryptography
Polynomials
Probabilistic logic
Public key
Security
Signcryption
title Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T15%3A59%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Cryptanalysis%20of%20Bohio%20et%20al.'s%20ID-Based%20Broadcast%20Signcryption%20(IBBSC)%20Scheme%20for%20Wireless%20Ad-Hoc%20Networks&rft.btitle=2008%20Sixth%20Annual%20Conference%20on%20Privacy,%20Security%20and%20Trust&rft.au=Sharmila%20Deva%20Selvi,%20S.&rft.date=2008-10&rft.spage=109&rft.epage=120&rft.pages=109-120&rft.isbn=0769533906&rft.isbn_list=9780769533902&rft_id=info:doi/10.1109/PST.2008.29&rft_dat=%3Cieee_6IE%3E4641278%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4641278&rfr_iscdi=true