Server-Aided Verification Signatures: Definitions and New Constructions
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Fast server-aided RSA signatures secure against active attacks
- scientific article; zbMATH DE number 503335 (Why is no real title available?)
- On verifiable implicit asking protocols for RSA computation
- Public Key Cryptography – PKC 2004
- RSA-based undeniable signatures
- Security and performance of server-aided RSA computation protocols
- Server-Aided Verification: Theory and Practice
- Short signatures from the Weil pairing
- The Béguin-Quisquater server-aided RSA protocol from Crypto '95 is not secure
Cited in
(9)- LOVE a pairing
- Anonymous single-round server-aided verification
- Secure outsourcing of modular exponentiations under single untrusted programme model
- Server (prover/signer)-aided verification of identity proofs and signatures
- CRT-based outsourcing algorithms for modular exponentiations
- A new construction of the server-aided verification signature scheme
- Server-Aided Verification: Theory and Practice
- Topics in Cryptology – CT-RSA 2004
- Provably secure server-aided verification signatures
This page was built for publication: Server-Aided Verification Signatures: Definitions and New Constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505465)