About: Sub-group hiding

An Entity of Type: WikicatComputationalHardnessAssumptions, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography. It was first introduced in to build a 2-DNF homomorphic encryption scheme.

Property Value
dbo:abstract
  • The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography. It was first introduced in to build a 2-DNF homomorphic encryption scheme. (en)
dbo:wikiPageID
  • 24165989 (xsd:integer)
dbo:wikiPageLength
  • 685 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 864437598 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography. It was first introduced in to build a 2-DNF homomorphic encryption scheme. (en)
rdfs:label
  • Sub-group hiding (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License