The following pages link to Ronald Cramer (Q509670):
Displaying 50 items.
- An improvement to the Hasse-Weil bound and applications to character sums, cryptography and coding (Q509671) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Amortized complexity of information-theoretically secure MPC revisited (Q775982) (← links)
- Linear-time non-malleable codes in the bit-wise independent tampering model (Q1705709) (← links)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority (Q1784115) (← links)
- Blackbox secret sharing revisited: a coding-theoretic approach with application to expansionless near-threshold schemes (Q2055621) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- On the complexity of arithmetic secret sharing (Q2119090) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC (Q2129015) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings (Q2175924) (← links)
- Contemporary cryptology. (Q2386512) (← links)
- Algebraic manipulation detection codes (Q2438532) (← links)
- Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) (Q2691584) (← links)
- Multi-Authority Secret-Ballot Elections with Linear Work (Q2876888) (← links)
- DDH-Like Assumptions Based on Extension Rings (Q2900250) (← links)
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions (Q2948388) (← links)
- Squares of Random Linear Codes (Q2978722) (← links)
- Torsion Limits and Riemann-Roch Systems for Function Fields and Applications (Q2986259) (← links)
- The Arithmetic Codex: Theory and Applications (Q3003369) (← links)
- (Q3149671) (← links)
- On the Amortized Complexity of Zero-Knowledge Protocols (Q3183564) (← links)
- Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field (Q3183580) (← links)
- On the complexity of verifiable secret sharing and multiparty computation (Q3192000) (← links)
- (Q3374918) (← links)
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems (Q3408192) (← links)
- New Generation of Secure and Practical RSA-Based Signatures (Q3452350) (← links)
- Bounded CCA2-Secure Encryption (Q3498396) (← links)
- On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes (Q3604694) (← links)
- A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra (Q3612573) (← links)
- (Q4249317) (← links)
- (Q4249348) (← links)
- (Q4250770) (← links)
- (Q4250896) (← links)
- (Q4343443) (← links)
- (Q4394211) (← links)
- (Q4409124) (← links)
- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments (Q4412799) (← links)
- (Q4434901) (← links)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack (Q4441904) (← links)
- (Q4527011) (← links)
- (Q4737235) (← links)
- (Q4783722) (← links)
- (Q4783743) (← links)
- (Q4880146) (← links)
- (Q4934736) (← links)
- (Q4940695) (← links)
- (Q4950056) (← links)
- Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time (Q5056439) (← links)
