The following pages link to (Q3210171):
Displaying 50 items.
- A conference key distribution system for the star configuration based on the discrete logarithm problem (Q287059) (← links)
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Threshold signature scheme with threshold verification based on multivariate linear polynomial (Q407483) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Security of BLS and BGLS signatures in a multi-user setting (Q680920) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- EPID with malicious revocation (Q826251) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- FROST: Flexible round-optimized Schnorr threshold signatures (Q832324) (← links)
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices (Q884001) (← links)
- Fast modular multi-exponentiation using modified complex arithmetic (Q884549) (← links)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
- Almost everywhere high nonuniform complexity (Q1190985) (← links)
- Elliptic curve cryptosystems and their implementation (Q1312102) (← links)
- Server-aided honest computation for cryptographic applications (Q1324374) (← links)
- Integrating authentication in public key distribution system (Q1350765) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- Improved low-computation partially blind signatures. (Q1412496) (← links)
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system (Q1639394) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- A threshold signature scheme based on the elliptic curve cryptosystem (Q1765851) (← links)
- Efficient on-line electronic checks (Q1765865) (← links)
- Adaptively secure distributed public-key systems. (Q1853497) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Threshold ECDSA with an offline recovery party (Q2053769) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- MPSign: a signature from small-secret middle-product learning with errors (Q2055685) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Threshold schemes from isogeny assumptions (Q2055691) (← links)
- Efficient redactable signature and application to anonymous credentials (Q2055711) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Improving revocation for group signature with redactable signature (Q2061923) (← links)
- More efficient digital signatures with tight multi-user security (Q2061945) (← links)
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms (Q2068384) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability (Q2104418) (← links)
