The following pages link to Lior Rotem (Q1629425):
Displaying 12 items.
- The security of lazy users in out-of-band authentication (Q1631350) (← links)
- Out-of-band authentication in group messaging: computational, statistical, optimal (Q1673381) (← links)
- Characterization of secure multiparty computation without broadcast (Q1753172) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- Algebraic distinguishers: from discrete logarithms to decisional Uber assumptions (Q2119087) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Characterization of Secure Multiparty Computation Without Broadcast (Q2796144) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- (Q6059368) (← links)
