Pages that link to "Item:Q1180508"
From MaRDI portal
The following pages link to Efficient signature generation by smart cards (Q1180508):
Displayed 50 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound (Q289922) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Zero-knowledge proofs of retrievability (Q350924) (← links)
- Extending concurrent signature to multiple parties (Q401477) (← links)
- An efficient collision detection method for computing discrete logarithms with Pollard's rho (Q411043) (← links)
- Secure proxy signature schemes for delegation of signing rights (Q421030) (← links)
- Group-oriented fair exchange of signatures (Q433010) (← links)
- Improved Pollard rho method for computing discrete logarithms over finite extension fields (Q442714) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- A note on asynchronous multi-exponentiation algorithm using binary representation (Q456161) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Concurrent signature without random oracles (Q476860) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Self-generated-certificate public key encryption without pairing and its application (Q545362) (← links)
- Practical electronic auction scheme with strong anonymity and bidding privacy (Q545374) (← links)
- A new threshold authenticated encryption scheme using labor-division signature (Q545432) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- Fair exchange of valuable information: a generalised framework (Q632798) (← links)
- Zero-knowledge identification scheme based on Weil pairing (Q639425) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- Several practical protocols for authentication and key exchange (Q673818) (← links)
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Certificateless threshold ring signature (Q730948) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Generic construction for tightly-secure signatures from discrete log (Q820557) (← links)
- Digital signature scheme set in a hidden cyclic group (Q821308) (← links)
- Signed Diffie-Hellman key exchange with tight security (Q826255) (← links)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- Efficient discrete logarithm based multi-signature scheme in the plain public key model (Q849361) (← links)
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point (Q850776) (← links)
- A novel deniable authentication protocol using generalized ElGamal signature scheme (Q865908) (← links)
- The random oracle model: a twenty-year retrospective (Q887442) (← links)
- Identity-based chameleon hashing and signatures without key exposure (Q903661) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Improved batch exponentiation (Q989500) (← links)
- Security of self-certified signatures (Q990946) (← links)
- Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces (Q1003091) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- New algorithms and protocols for information authentication in automatic control systems (Q1015349) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Information authentication in automated control systems based on finite groups with multidimensional cyclicity (Q1040545) (← links)
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys. (Q1603445) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Improved algebraic MACs and practical keyed-verification anonymous credentials (Q1698653) (← links)