Combinatorial bounds for broadcast encryption
A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmiss...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 526 |
|---|---|
| container_issue | |
| container_start_page | 512 |
| container_title | |
| container_volume | |
| creator | Luby, Michael Staddon, Jessica |
| description | A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broadcast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds. |
| doi_str_mv | 10.1007/BFb0054150 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_2289285</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2289285</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-d67cc48cc3bbfc62bda0d8fc1a3da4f7970c87575f7334e721850f2184832973</originalsourceid><addsrcrecordid>eNpFUDtPwzAYNC-JqGThF2RgYAl8fuWzR6goIFVi6R75EaNAGkd2GPrvCSpSb7gb7nQ6HSG3FB4oAD4-byyAFFTCGSk1Ki4FNBq1FOekoA2lNedCX5w8IakSl6QADqzWKPg1KXP-ggWcgRZYkHod97YfzRxTb4bKxp_R5yrEVNkUjXcmz1U3unSY5j6ON-QqmCF35b-uyG7zslu_1duP1_f107Z2vIG59g06J5Rz3NrgGma9Aa-Co4Z7IwJqBKdQogy4LO6QUSUhLCwUZxr5itwdayeTnRlCMqPrczulfm_SoWVMaabkErs_xvLijJ9dam2M37ml0P791Z7-4r_oBVaR</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Combinatorial bounds for broadcast encryption</title><source>Springer Books</source><creator>Luby, Michael ; Staddon, Jessica</creator><contributor>Nyberg, Kaisa</contributor><creatorcontrib>Luby, Michael ; Staddon, Jessica ; Nyberg, Kaisa</creatorcontrib><description>A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broadcast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540645184</identifier><identifier>ISBN: 3540645187</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540697954</identifier><identifier>EISBN: 3540697950</identifier><identifier>DOI: 10.1007/BFb0054150</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Broadcast Encryption ; Characteristic String ; Consistent Protocol ; Cryptography ; Establishment Protocol ; Exact sciences and technology ; Information, signal and communications theory ; Privileged User ; Signal and communications theory ; Telecommunications and information theory</subject><ispartof>Advances in Cryptology — EUROCRYPT'98, 1998, p.512-526</ispartof><rights>Springer-Verlag Berlin Heidelberg 1998</rights><rights>1998 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-d67cc48cc3bbfc62bda0d8fc1a3da4f7970c87575f7334e721850f2184832973</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0054150$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0054150$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,27923,38253,41440,42509</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2289285$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Nyberg, Kaisa</contributor><creatorcontrib>Luby, Michael</creatorcontrib><creatorcontrib>Staddon, Jessica</creatorcontrib><title>Combinatorial bounds for broadcast encryption</title><title>Advances in Cryptology — EUROCRYPT'98</title><description>A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broadcast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.</description><subject>Applied sciences</subject><subject>Broadcast Encryption</subject><subject>Characteristic String</subject><subject>Consistent Protocol</subject><subject>Cryptography</subject><subject>Establishment Protocol</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Privileged User</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540645184</isbn><isbn>3540645187</isbn><isbn>9783540697954</isbn><isbn>3540697950</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1998</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFUDtPwzAYNC-JqGThF2RgYAl8fuWzR6goIFVi6R75EaNAGkd2GPrvCSpSb7gb7nQ6HSG3FB4oAD4-byyAFFTCGSk1Ki4FNBq1FOekoA2lNedCX5w8IakSl6QADqzWKPg1KXP-ggWcgRZYkHod97YfzRxTb4bKxp_R5yrEVNkUjXcmz1U3unSY5j6ON-QqmCF35b-uyG7zslu_1duP1_f107Z2vIG59g06J5Rz3NrgGma9Aa-Co4Z7IwJqBKdQogy4LO6QUSUhLCwUZxr5itwdayeTnRlCMqPrczulfm_SoWVMaabkErs_xvLijJ9dam2M37ml0P791Z7-4r_oBVaR</recordid><startdate>19980101</startdate><enddate>19980101</enddate><creator>Luby, Michael</creator><creator>Staddon, Jessica</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>19980101</creationdate><title>Combinatorial bounds for broadcast encryption</title><author>Luby, Michael ; Staddon, Jessica</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-d67cc48cc3bbfc62bda0d8fc1a3da4f7970c87575f7334e721850f2184832973</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Applied sciences</topic><topic>Broadcast Encryption</topic><topic>Characteristic String</topic><topic>Consistent Protocol</topic><topic>Cryptography</topic><topic>Establishment Protocol</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Privileged User</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Luby, Michael</creatorcontrib><creatorcontrib>Staddon, Jessica</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Luby, Michael</au><au>Staddon, Jessica</au><au>Nyberg, Kaisa</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Combinatorial bounds for broadcast encryption</atitle><btitle>Advances in Cryptology — EUROCRYPT'98</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1998-01-01</date><risdate>1998</risdate><spage>512</spage><epage>526</epage><pages>512-526</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540645184</isbn><isbn>3540645187</isbn><eisbn>9783540697954</eisbn><eisbn>3540697950</eisbn><abstract>A broadcast encryption system allows a center to communicate securely over a broadcast channel with selected sets of users. Each time the set of privileged users changes, the center enacts a protocol to establish a new broadcast key that only the privileged users can obtain, and subsequent transmissions by the center are encrypted using the new broadcast key. We study the inherent trade-off between the number of establishment keys held by each user and the number of transmissions needed to establish a new broadcast key. For every given upper bound on the number of establishment keys held by each user, we prove a lower bound on the number of transmissions needed to establish a new broadcast key. We show that these bounds are essentially tight, by describing broadcast encryption systems that come close to these bounds.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0054150</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Advances in Cryptology — EUROCRYPT'98, 1998, p.512-526 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_2289285 |
| source | Springer Books |
| subjects | Applied sciences Broadcast Encryption Characteristic String Consistent Protocol Cryptography Establishment Protocol Exact sciences and technology Information, signal and communications theory Privileged User Signal and communications theory Telecommunications and information theory |
| title | Combinatorial bounds for broadcast encryption |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T14%3A43%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Combinatorial%20bounds%20for%20broadcast%20encryption&rft.btitle=Advances%20in%20Cryptology%20%E2%80%94%20EUROCRYPT'98&rft.au=Luby,%20Michael&rft.date=1998-01-01&rft.spage=512&rft.epage=526&rft.pages=512-526&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540645184&rft.isbn_list=3540645187&rft_id=info:doi/10.1007/BFb0054150&rft_dat=%3Cpascalfrancis_sprin%3E2289285%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540697954&rft.eisbn_list=3540697950&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |