The following pages link to Victor Shoup (Q911293):
Displaying 50 items.
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Factoring polynomials using fewer random bits (Q912919) (← links)
- The twin Diffie-Hellman problem and applications (Q1037234) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Primality testing with fewer random bits (Q1321031) (← links)
- Lower bounds for polynomial evaluation and interpolation problems (Q1386175) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Securing threshold cryptosystems against chosen ciphertext attack (Q1601827) (← links)
- Faster homomorphic linear transformations in HElib (Q1673382) (← links)
- On the security of a practical identification scheme (Q1819122) (← links)
- OAEP reconsidered (Q1865124) (← links)
- A new polynomial factorization algorithm and its implementation (Q1914167) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Security analysis of \textit{SPAKE2+} (Q2119068) (← links)
- On the security of ECDSA with additive key derivation and presignatures (Q2170006) (← links)
- A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack (Q2267360) (← links)
- An improved RNS variant of the BFV homomorphic encryption scheme (Q2290443) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography (Q2501710) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Bootstrapping for helib (Q2661696) (← links)
- Algorithms in HElib (Q2874526) (← links)
- Session Key Distribution Using Smart Cards (Q2876912) (← links)
- On the Security of a Practical Identification Scheme (Q2876914) (← links)
- Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn (Q2925560) (← links)
- Bootstrapping for HElib (Q2948347) (← links)
- A Framework for Practical Universally Composable Zero-Knowledge Protocols (Q3102202) (← links)
- (Q3140455) (← links)
- (Q3374914) (← links)
- (Q3374928) (← links)
- (Q3374942) (← links)
- On Fast and Provably Secure Message Authentication Based on Universal Hashing (Q3452360) (← links)
- Factorization in Z[x] (Q3454736) (← links)
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields (Q3497178) (← links)
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model (Q3562884) (← links)
- Credential Authenticated Identification and Key Exchange (Q3582759) (← links)
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs (Q3600238) (← links)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- Searching for Primitive Roots in Finite Fields (Q3987942) (← links)
- (Q4226960) (← links)
- (Q4234088) (← links)
- (Q4237366) (← links)
- (Q4249317) (← links)
- Securing threshold cryptosystems against chosen ciphertext attack (Q4249624) (← links)
- Optimistic fair exchange of digital signatures (Q4249668) (← links)
- (Q4279585) (← links)
- Subquadratic-time factoring of polynomials over finite fields (Q4396457) (← links)
- (Q4409134) (← links)
- (Q4418529) (← links)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (Q4441904) (← links)
