Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/iacr/Rambaud23>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Matthieu_Rambaud>
foaf:homepage	<https://eprint.iacr.org/2023/1757>
dc:identifier	DBLP journals/iacr/Rambaud23 (xsd:string)
dcterms:issued	2023 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/iacr>
rdfs:label	Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Matthieu_Rambaud>
swrc:pages	1757 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/iacr/Rambaud23/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/iacr/Rambaud23>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/iacr/iacr2023.html#Rambaud23>
rdfs:seeAlso	<https://eprint.iacr.org/2023/1757>
dc:title	Adaptively Secure Consensus with Linear Complexity and Constant Round under Honest Majority in the Bare PKI Model, and Separation Bounds from the Idealized Message-Authentication Model. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	2023 (xsd:string)