Pages that link to "Item:Q5739217"

The following pages link to Randomness Complexity of Private Circuits for Multiplication (Q5739217):

Displaying 21 items.

• Computing OR on a randomized fixed adversary CRCW PRAM (Q287164) (← links)
• \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations (Q831640) (← links)
• Circuit size relative to pseudorandom oracles (Q1208410) (← links)
• Private multiplication over finite fields (Q1675211) (← links)
• Side-channel masking with pseudo-random generator (Q2055660) (← links)
• Fast verification of masking schemes in characteristic two (Q2056733) (← links)
• On the power of expansion: more efficient constructions in the random probing model (Q2056735) (← links)
• Custom instruction support for modular defense against side-channel and fault attacks (Q2106699) (← links)
• Private circuits with quasilinear randomness (Q2170088) (← links)
• Packed multiplication: how to amortize the cost of side-channel masking? (Q2692370) (← links)
• Reducing Randomness Complexity of Mask Refreshing Algorithm (Q3297482) (← links)
• Secure Multiplication for Bitslice Higher-Order Masking: Optimisation and Comparison (Q3297548) (← links)
• Randomness in Private Computations (Q4377451) (← links)
• Private Computations over the Integers (Q4834387) (← links)
• Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model (Q5738889) (← links)
• Unconditionally secure computation against low-complexity leakage (Q5918097) (← links)
• Correction to: ``Unconditionally secure computation against low-complexity leakage'' (Q5925544) (← links)
• Effective and efficient masking with low noise using small-Mersenne-prime ciphers (Q6061536) (← links)
• Dynamic random probing expansion with quasi linear asymptotic complexity (Q6157515) (← links)
• Automated verification of correctness for masked arithmetic programs (Q6535686) (← links)
• Exploiting algebraic structures in probing security (Q6604876) (← links)