Matches in SemOpenAlex for { <https://semopenalex.org/work/W3032107178> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W3032107178 startingPage "211" @default.
- W3032107178 abstract "Many cryptographic algorithms are vulnerable to side channel analysis and several leakage models have been introduced to better understand these flaws. In 2003, Ishai, Sahai and Wagner introduced the d-probing security model, in which an attacker can observe at most d intermediate values during a processing. They also proposed an algorithm that securely performs the multiplication of 2 bits in this model, using only $$dd+1/2$$dd+1/2 random bits to protect the computation. We study the randomness complexity of multiplication algorithms secure in the d-probing model. We propose several contributions: we provide new theoretical characterizations and constructions, new practical constructions and a new efficient algorithmic tool to analyze the security of such schemes.We start with a theoretical treatment of the subject: we propose an algebraic model for multiplication algorithms and exhibit an algebraic characterization of the security in the d-probing model. Using this characterization, we prove a linear in d lower bound and a quasi-linear non-constructive upper bound for this randomness cost. Then, we construct a new generic algorithm to perform secure multiplication in the d-probing model that only uses $$d + d^2/4$$d+d2/4 random bits.From a practical point of view, we consider the important cases $$d le 4$$d≤4 that are actually used in current real-life implementations and we build algorithms with a randomness complexity matching our theoretical lower bound for these small-order cases. Finally, still using our algebraic characterization, we provide a new dedicated verification tool, based on information set decoding, which aims at finding attacks on algorithms for fixed order d at a very low computational cost." @default.
- W3032107178 created "2020-06-05" @default.
- W3032107178 creator A5007227314 @default.
- W3032107178 creator A5028094453 @default.
- W3032107178 creator A5060299604 @default.
- W3032107178 creator A5062283993 @default.
- W3032107178 creator A5088875582 @default.
- W3032107178 creator A5091750695 @default.
- W3032107178 date "2016-01-01" @default.
- W3032107178 modified "2023-09-28" @default.
- W3032107178 title "Randomness Complexity of Private Circuits for Multiplication." @default.
- W3032107178 hasPublicationYear "2016" @default.
- W3032107178 type Work @default.
- W3032107178 sameAs 3032107178 @default.
- W3032107178 citedByCount "0" @default.
- W3032107178 crossrefType "posted-content" @default.
- W3032107178 hasAuthorship W3032107178A5007227314 @default.
- W3032107178 hasAuthorship W3032107178A5028094453 @default.
- W3032107178 hasAuthorship W3032107178A5060299604 @default.
- W3032107178 hasAuthorship W3032107178A5062283993 @default.
- W3032107178 hasAuthorship W3032107178A5088875582 @default.
- W3032107178 hasAuthorship W3032107178A5091750695 @default.
- W3032107178 hasConcept C105795698 @default.
- W3032107178 hasConcept C11413529 @default.
- W3032107178 hasConcept C114614502 @default.
- W3032107178 hasConcept C125112378 @default.
- W3032107178 hasConcept C134306372 @default.
- W3032107178 hasConcept C178489894 @default.
- W3032107178 hasConcept C18017163 @default.
- W3032107178 hasConcept C2780595030 @default.
- W3032107178 hasConcept C311688 @default.
- W3032107178 hasConcept C33923547 @default.
- W3032107178 hasConcept C41008148 @default.
- W3032107178 hasConcept C77553402 @default.
- W3032107178 hasConcept C80444323 @default.
- W3032107178 hasConcept C9376300 @default.
- W3032107178 hasConceptScore W3032107178C105795698 @default.
- W3032107178 hasConceptScore W3032107178C11413529 @default.
- W3032107178 hasConceptScore W3032107178C114614502 @default.
- W3032107178 hasConceptScore W3032107178C125112378 @default.
- W3032107178 hasConceptScore W3032107178C134306372 @default.
- W3032107178 hasConceptScore W3032107178C178489894 @default.
- W3032107178 hasConceptScore W3032107178C18017163 @default.
- W3032107178 hasConceptScore W3032107178C2780595030 @default.
- W3032107178 hasConceptScore W3032107178C311688 @default.
- W3032107178 hasConceptScore W3032107178C33923547 @default.
- W3032107178 hasConceptScore W3032107178C41008148 @default.
- W3032107178 hasConceptScore W3032107178C77553402 @default.
- W3032107178 hasConceptScore W3032107178C80444323 @default.
- W3032107178 hasConceptScore W3032107178C9376300 @default.
- W3032107178 hasLocation W30321071781 @default.
- W3032107178 hasOpenAccess W3032107178 @default.
- W3032107178 hasPrimaryLocation W30321071781 @default.
- W3032107178 hasRelatedWork W1484453194 @default.
- W3032107178 hasRelatedWork W1840310247 @default.
- W3032107178 hasRelatedWork W1946311904 @default.
- W3032107178 hasRelatedWork W2032842968 @default.
- W3032107178 hasRelatedWork W2053952803 @default.
- W3032107178 hasRelatedWork W2068145107 @default.
- W3032107178 hasRelatedWork W2144560442 @default.
- W3032107178 hasRelatedWork W2181396417 @default.
- W3032107178 hasRelatedWork W2262841793 @default.
- W3032107178 hasRelatedWork W2295080346 @default.
- W3032107178 hasRelatedWork W2603155476 @default.
- W3032107178 hasRelatedWork W2613178308 @default.
- W3032107178 hasRelatedWork W2740740730 @default.
- W3032107178 hasRelatedWork W2804976171 @default.
- W3032107178 hasRelatedWork W2950332948 @default.
- W3032107178 hasRelatedWork W2952964569 @default.
- W3032107178 hasRelatedWork W2972370391 @default.
- W3032107178 hasRelatedWork W3037152834 @default.
- W3032107178 hasRelatedWork W3113635031 @default.
- W3032107178 hasRelatedWork W95329691 @default.
- W3032107178 hasVolume "2016" @default.
- W3032107178 isParatext "false" @default.
- W3032107178 isRetracted "false" @default.
- W3032107178 magId "3032107178" @default.
- W3032107178 workType "article" @default.