<?xml version="1.0" encoding="UTF-8" ?>
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</dc:title>
<dc:creator>Daza, Vanesa</dc:creator>
<dc:creator>Herranz, Javier</dc:creator>
<dc:creator>Morillo, Paz</dc:creator>
<dc:creator>Ràfols, Carla</dc:creator>
<dc:subject>Threshold encryption</dc:subject>
<dc:subject>Ad-hoc and dynamic groups</dc:subject>
<dc:subject>ElGamal cryptosystem</dc:subject>
<dc:description>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</dc:description>
<dc:date>2008</dc:date>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:type>info:eu-repo/semantics/acceptedVersion</dc:type>
<dc:identifier>Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:identifier>1571-0661</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/42273</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</dc:relation>
<dc:rights>© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:format>application/pdf</dc:format>
<dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<d:DIDL schemaLocation="urn:mpeg:mpeg21:2002:02-DIDL-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/did/didl.xsd">
<d:DIDLInfo>
<dcterms:created schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/dcterms.xsd">2019-09-12T17:18:43Z</dcterms:created>
</d:DIDLInfo>
<d:Item id="hdl_10230_42273">
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=utf-8">
<dii:Identifier schemaLocation="urn:mpeg:mpeg21:2002:01-DII-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/dii/dii.xsd">urn:hdl:10230/42273</dii:Identifier>
</d:Statement>
</d:Descriptor>
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=utf-8">
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</dc:title>
<dc:creator>Daza, Vanesa</dc:creator>
<dc:creator>Herranz, Javier</dc:creator>
<dc:creator>Morillo, Paz</dc:creator>
<dc:creator>Ràfols, Carla</dc:creator>
<dc:description>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</dc:description>
<dc:date>2019-09-12T17:18:43Z</dc:date>
<dc:date>2019-09-12T17:18:43Z</dc:date>
<dc:date>2008</dc:date>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:identifier>Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:identifier>1571-0661</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/42273</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc>
</d:Statement>
</d:Descriptor>
<d:Component id="10230_42273_1">
</d:Component>
</d:Item>
</d:DIDL>
<?xml version="1.0" encoding="UTF-8" ?>
<dim:dim schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
<dim:field element="contributor" mdschema="dc" qualifier="author">Daza, Vanesa</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Herranz, Javier</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Morillo, Paz</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Ràfols, Carla</dim:field>
<dim:field element="date" mdschema="dc" qualifier="accessioned">2019-09-12T17:18:43Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="available">2019-09-12T17:18:43Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="issued">2008</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="citation">Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="issn">1571-0661</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="uri">http://hdl.handle.net/10230/42273</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="doi">http://dx.doi.org/10.1016/j.entcs.2008.05.002</dim:field>
<dim:field element="description" lang="en" mdschema="dc" qualifier="abstract">In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</dim:field>
<dim:field element="description" lang="en" mdschema="dc" qualifier="provenance">Made available in DSpace on 2019-09-12T17:18:43Z (GMT). No. of bitstreams: 1 rafols_ENTCS_adhoc.pdf: 361508 bytes, checksum: 36914e6ac59a7c22bab7af6118aba99b (MD5) Previous issue date: 2008</dim:field>
<dim:field element="format" mdschema="dc" qualifier="mimetype">application/pdf</dim:field>
<dim:field element="language" mdschema="dc" qualifier="iso">eng</dim:field>
<dim:field element="publisher" mdschema="dc">Elsevier</dim:field>
<dim:field element="relation" mdschema="dc" qualifier="ispartof">Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</dim:field>
<dim:field element="rights" mdschema="dc">© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</dim:field>
<dim:field element="rights" mdschema="dc" qualifier="uri">http://creativecommons.org/licenses/by-nc-nd/3.0/</dim:field>
<dim:field element="rights" mdschema="dc" qualifier="accessRights">info:eu-repo/semantics/openAccess</dim:field>
<dim:field element="title" mdschema="dc">'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</dim:field>
<dim:field element="type" mdschema="dc">info:eu-repo/semantics/conferenceObject</dim:field>
<dim:field element="type" mdschema="dc" qualifier="version">info:eu-repo/semantics/acceptedVersion</dim:field>
<dim:field element="subject" lang="en" mdschema="dc" qualifier="keyword">Threshold encryption</dim:field>
<dim:field element="subject" lang="en" mdschema="dc" qualifier="keyword">Ad-hoc and dynamic groups</dim:field>
<dim:field element="subject" lang="en" mdschema="dc" qualifier="keyword">ElGamal cryptosystem</dim:field>
</dim:dim>
<?xml version="1.0" encoding="UTF-8" ?>
<thesis schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</title>
<creator>Daza, Vanesa</creator>
<creator>Herranz, Javier</creator>
<creator>Morillo, Paz</creator>
<creator>Ràfols, Carla</creator>
<description>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</description>
<date>2019-09-12</date>
<date>2019-09-12</date>
<date>2008</date>
<type>info:eu-repo/semantics/conferenceObject</type>
<identifier>Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</identifier>
<identifier>1571-0661</identifier>
<identifier>http://hdl.handle.net/10230/42273</identifier>
<identifier>http://dx.doi.org/10.1016/j.entcs.2008.05.002</identifier>
<language>eng</language>
<relation>Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</relation>
<rights>http://creativecommons.org/licenses/by-nc-nd/3.0/</rights>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</rights>
<publisher>Elsevier</publisher>
</thesis>
<?xml version="1.0" encoding="UTF-8" ?>
<record schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield ind1=" " ind2=" " tag="042">
<subfield code="a">dc</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Daza, Vanesa</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Herranz, Javier</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Morillo, Paz</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Ràfols, Carla</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="260">
<subfield code="c">2008</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="520">
<subfield code="a">In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">1571-0661</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://hdl.handle.net/10230/42273</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://dx.doi.org/10.1016/j.entcs.2008.05.002</subfield>
</datafield>
<datafield ind1="0" ind2="0" tag="245">
<subfield code="a">'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</subfield>
</datafield>
</record>
<?xml version="1.0" encoding="UTF-8" ?>
<mets ID=" DSpace_ITEM_10230-42273" OBJID=" hdl:10230/42273" PROFILE="DSpace METS SIP Profile 1.0" TYPE="DSpace ITEM" schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd">
<metsHdr CREATEDATE="2022-11-15T23:43:19Z">
<agent ROLE="CUSTODIAN" TYPE="ORGANIZATION">
<name>Repositori digital de la UPF</name>
</agent>
</metsHdr>
<dmdSec ID="DMD_10230_42273">
<mdWrap MDTYPE="MODS">
<xmlData schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Daza, Vanesa</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Herranz, Javier</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Morillo, Paz</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Ràfols, Carla</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2019-09-12T17:18:43Z</mods:dateAccessioned>
</mods:extension>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2019-09-12T17:18:43Z</mods:dateAvailable>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2008</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</mods:identifier>
<mods:identifier type="issn">1571-0661</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/10230/42273</mods:identifier>
<mods:identifier type="doi">http://dx.doi.org/10.1016/j.entcs.2008.05.002</mods:identifier>
<mods:abstract>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</mods:abstract>
<mods:language>
<mods:languageTerm authority="rfc3066">eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</mods:accessCondition>
<mods:titleInfo>
<mods:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/conferenceObject</mods:genre>
</mods:mods>
</xmlData>
</mdWrap>
</dmdSec>
<amdSec ID="FO_10230_42273_1">
<techMD ID="TECH_O_10230_42273_1">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>http://repositori.upf.edu/bitstream/10230/42273/1/rafols_ENTCS_adhoc.pdf</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>36914e6ac59a7c22bab7af6118aba99b</premis:messageDigest>
</premis:fixity>
<premis:size>361508</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>application/pdf</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>rafols_ENTCS_adhoc.pdf</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<amdSec ID="FT_10230_42273_2">
<techMD ID="TECH_T_10230_42273_2">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>http://repositori.upf.edu/bitstream/10230/42273/2/rafols_ENTCS_adhoc.pdf.txt</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>3d8167a144352625a767a0c357c3e911</premis:messageDigest>
</premis:fixity>
<premis:size>34839</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>text/plain</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>rafols_ENTCS_adhoc.pdf.txt</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<fileSec>
<fileGrp USE="ORIGINAL">
<file ADMID="FO_10230_42273_1" CHECKSUM="36914e6ac59a7c22bab7af6118aba99b" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_10230_42273_1" ID="BITSTREAM_ORIGINAL_10230_42273_1" MIMETYPE="application/pdf" SEQ="1" SIZE="361508">
</file>
</fileGrp>
<fileGrp USE="TEXT">
<file ADMID="FT_10230_42273_2" CHECKSUM="3d8167a144352625a767a0c357c3e911" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_10230_42273_2" ID="BITSTREAM_TEXT_10230_42273_2" MIMETYPE="text/plain" SEQ="2" SIZE="34839">
</file>
</fileGrp>
</fileSec>
<structMap LABEL="DSpace Object" TYPE="LOGICAL">
<div ADMID="DMD_10230_42273" TYPE="DSpace Object Contents">
<div TYPE="DSpace BITSTREAM">
</div>
</div>
</structMap>
</mets>
<?xml version="1.0" encoding="UTF-8" ?>
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>Daza, Vanesa</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Herranz, Javier</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Morillo, Paz</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Ràfols, Carla</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2019-09-12T17:18:43Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2019-09-12T17:18:43Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2008</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</mods:identifier>
<mods:identifier type="issn">1571-0661</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/10230/42273</mods:identifier>
<mods:identifier type="doi">http://dx.doi.org/10.1016/j.entcs.2008.05.002</mods:identifier>
<mods:abstract>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by-nc-nd/3.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</mods:accessCondition>
<mods:titleInfo>
<mods:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/conferenceObject</mods:genre>
</mods:mods>
<?xml version="1.0" encoding="UTF-8" ?>
<atom:entry schemaLocation="http://www.w3.org/2005/Atom http://www.kbcafe.com/rss/atom.xsd.xml">
<atom:id>http://oai-repositori.upf.edu/oai/metadata/handle/10230/42273/ore.xml</atom:id>
<atom:published>2019-09-12T17:18:43Z</atom:published>
<atom:updated>2019-09-12T17:18:43Z</atom:updated>
<atom:source>
<atom:generator>Repositori digital de la UPF</atom:generator>
</atom:source>
<atom:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</atom:title>
<atom:author>
<atom:name>Daza, Vanesa</atom:name>
</atom:author>
<atom:author>
<atom:name>Herranz, Javier</atom:name>
</atom:author>
<atom:author>
<atom:name>Morillo, Paz</atom:name>
</atom:author>
<atom:author>
<atom:name>Ràfols, Carla</atom:name>
</atom:author>
<oreatom:triples>
<rdf:Description about="http://oai-repositori.upf.edu/oai/metadata/handle/10230/42273/ore.xml#atom">
<dcterms:modified>2019-09-12T17:18:43Z</dcterms:modified>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/42273/3/rafols_ENTCS_adhoc.pdf.jpg">
<dcterms:description>THUMBNAIL</dcterms:description>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/42273/2/rafols_ENTCS_adhoc.pdf.txt">
<dcterms:description>TEXT</dcterms:description>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/42273/1/rafols_ENTCS_adhoc.pdf">
<dcterms:description>ORIGINAL</dcterms:description>
</rdf:Description>
</oreatom:triples>
</atom:entry>
<?xml version="1.0" encoding="UTF-8" ?>
<qdc:qualifieddc schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</dc:title>
<dc:creator>Daza, Vanesa</dc:creator>
<dc:creator>Herranz, Javier</dc:creator>
<dc:creator>Morillo, Paz</dc:creator>
<dc:creator>Ràfols, Carla</dc:creator>
<dcterms:abstract>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</dcterms:abstract>
<dc:date>2008</dc:date>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:identifier>Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:identifier>1571-0661</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/42273</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</qdc:qualifieddc>
<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication about="oai:repositori.upf.edu:10230/42273">
<dc:title>'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</dc:title>
<dc:creator>Daza, Vanesa</dc:creator>
<dc:creator>Herranz, Javier</dc:creator>
<dc:creator>Morillo, Paz</dc:creator>
<dc:creator>Ràfols, Carla</dc:creator>
<dc:description>In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</dc:description>
<dc:date>2008</dc:date>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:identifier>Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:identifier>1571-0661</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/42273</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.entcs.2008.05.002</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</ow:Publication>
</rdf:RDF>
<?xml version="1.0" encoding="UTF-8" ?>
<metadata schemaLocation="http://www.lyncode.com/xoai http://www.lyncode.com/xsd/xoai.xsd">
<element name="dc">
<element name="contributor">
<element name="author">
<element name="none">
<field name="value">Daza, Vanesa</field>
<field name="value">Herranz, Javier</field>
<field name="value">Morillo, Paz</field>
<field name="value">Ràfols, Carla</field>
</element>
</element>
</element>
<element name="date">
<element name="accessioned">
<element name="none">
<field name="value">2019-09-12T17:18:43Z</field>
</element>
</element>
<element name="available">
<element name="none">
<field name="value">2019-09-12T17:18:43Z</field>
</element>
</element>
<element name="issued">
<element name="none">
<field name="value">2008</field>
</element>
</element>
</element>
<element name="identifier">
<element name="citation">
<element name="none">
<field name="value">Daza V, Herranz J, Morillo P, Ràfols C. 'Ad-hoc' threshold broadcast encryption with shorter ciphertexts. Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15. DOI: 10.1016/j.entcs.2008.05.002</field>
</element>
</element>
<element name="issn">
<element name="none">
<field name="value">1571-0661</field>
</element>
</element>
<element name="uri">
<element name="none">
<field name="value">http://hdl.handle.net/10230/42273</field>
</element>
</element>
<element name="doi">
<element name="none">
<field name="value">http://dx.doi.org/10.1016/j.entcs.2008.05.002</field>
</element>
</element>
</element>
<element name="description">
<element name="abstract">
<element name="en">
<field name="value">In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the receivers, in such a way that the original plaintext can be recovered only if at least t receivers cooperate. This kind of scheme has many applications in mobile ad-hoc networks, characterized by their lack of infrastructure as well as for the high dynamism of their nodes. Threshold broadcast encryption schemes are much more appropriate for mobile ad-hoc scenarios than standard threshold public key encryption schemes, where the set of receivers and the threshold for decryption must be known in advance (and remain the same for the rest of the protocol). Previously proposed threshold broadcast encryption schemes have ciphertexts which contain at least n group elements. In this paper, we propose a new scheme where the ciphertexts contain essentially n − t group elements. The construction uses secret sharing techniques and the ElGamal public key cryptosystem as basic tools. We formally prove the security of the scheme, by reduction to the security of ElGamal cryptosystem.</field>
</element>
</element>
<element name="provenance">
<element name="en">
<field name="value">Made available in DSpace on 2019-09-12T17:18:43Z (GMT). No. of bitstreams: 1 rafols_ENTCS_adhoc.pdf: 361508 bytes, checksum: 36914e6ac59a7c22bab7af6118aba99b (MD5) Previous issue date: 2008</field>
</element>
</element>
</element>
<element name="format">
<element name="mimetype">
<element name="none">
<field name="value">application/pdf</field>
</element>
</element>
</element>
<element name="language">
<element name="iso">
<element name="none">
<field name="value">eng</field>
</element>
</element>
</element>
<element name="publisher">
<element name="none">
<field name="value">Elsevier</field>
</element>
</element>
<element name="relation">
<element name="ispartof">
<element name="none">
<field name="value">Electronic Notes in Theoretical Computer Science. 2008;192(2):3-15.</field>
</element>
</element>
</element>
<element name="rights">
<element name="none">
<field name="value">© 2008 Elsevier B.V. www.elsevier.com/locate/entcs Open access under CC BY-NC-ND license.</field>
</element>
<element name="uri">
<element name="none">
<field name="value">http://creativecommons.org/licenses/by-nc-nd/3.0/</field>
</element>
</element>
<element name="accessRights">
<element name="none">
<field name="value">info:eu-repo/semantics/openAccess</field>
</element>
</element>
</element>
<element name="title">
<element name="none">
<field name="value">'Ad-hoc' threshold broadcast encryption with shorter ciphertexts</field>
</element>
</element>
<element name="type">
<element name="none">
<field name="value">info:eu-repo/semantics/conferenceObject</field>
</element>
<element name="version">
<element name="none">
<field name="value">info:eu-repo/semantics/acceptedVersion</field>
</element>
</element>
</element>
<element name="subject">
<element name="keyword">
<element name="en">
<field name="value">Threshold encryption</field>
<field name="value">Ad-hoc and dynamic groups</field>
<field name="value">ElGamal cryptosystem</field>
</element>
</element>
</element>
</element>
<element name="bundles">
<element name="bundle">
<field name="name">THUMBNAIL</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">rafols_ENTCS_adhoc.pdf.jpg</field>
<field name="originalName">rafols_ENTCS_adhoc.pdf.jpg</field>
<field name="description">IM Thumbnail</field>
<field name="format">image/jpeg</field>
<field name="size">15998</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/42273/3/rafols_ENTCS_adhoc.pdf.jpg</field>
<field name="checksum">d570b0d081e7a8794cd1d20d8517ba4b</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">3</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">TEXT</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">rafols_ENTCS_adhoc.pdf.txt</field>
<field name="originalName">rafols_ENTCS_adhoc.pdf.txt</field>
<field name="description">Extracted text</field>
<field name="format">text/plain</field>
<field name="size">34839</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/42273/2/rafols_ENTCS_adhoc.pdf.txt</field>
<field name="checksum">3d8167a144352625a767a0c357c3e911</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">2</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">ORIGINAL</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">rafols_ENTCS_adhoc.pdf</field>
<field name="format">application/pdf</field>
<field name="size">361508</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/42273/1/rafols_ENTCS_adhoc.pdf</field>
<field name="checksum">36914e6ac59a7c22bab7af6118aba99b</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">1</field>
</element>
</element>
</element>
</element>
<element name="others">
<field name="handle">10230/42273</field>
<field name="identifier">oai:repositori.upf.edu:10230/42273</field>
<field name="lastModifyDate">2020-04-09 12:09:49.206</field>
</element>
<element name="repository">
<field name="name">Repositori digital de la UPF</field>
<field name="mail">repositori@upf.edu</field>
</element>
</metadata>