Pages that link to "Item:Q3777940"
From MaRDI portal
The following pages link to How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940):
Displaying 50 items.
- Combined schemes for signature and encryption: the public-key and the identity-based setting (Q259033) (← links)
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Limits on the usefulness of random oracles (Q290382) (← links)
- Twin-Beth: security under active and concurrent attacks for the Beth identity-based identification scheme (Q301642) (← links)
- Blind attribute-based encryption and oblivious transfer with fine-grained access control (Q306333) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Identity based identification from algebraic coding theory (Q391761) (← links)
- Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
- Paillier-based publicly verifiable (non-interactive) secret sharing (Q398963) (← links)
- Extending concurrent signature to multiple parties (Q401477) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Identity-based partially blind signature in the standard model for electronic cash (Q462748) (← links)
- Secure identification and QKD in the bounded-quantum-storage model (Q477165) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Bounded tamper resilience: how to go beyond the algebraic barrier (Q514469) (← links)
- On server trust in private proxy auctions (Q608995) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- Zero-knowledge identification scheme based on Weil pairing (Q639425) (← links)
- Several practical protocols for authentication and key exchange (Q673818) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- \(k\)-anonymous data collection (Q730905) (← links)
- On best-possible obfuscation (Q744349) (← links)
- On the amortized complexity of zero-knowledge protocols (Q744603) (← links)
- Bit commitment using pseudorandomness (Q808241) (← links)
- Lattice-based proof of shuffle and applications to electronic voting (Q826259) (← links)
- More efficient shuffle argument from unique factorization (Q826262) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- Multi-designated verifiers signatures: anonymity without encryption (Q845986) (← links)
- Optimal resilient threshold GQ signatures (Q881852) (← links)
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices (Q884001) (← links)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- Rogue-key attacks on the multi-designated verifiers signature scheme (Q963405) (← links)
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 (Q989506) (← links)
- Ring signatures: Stronger definitions, and constructions without random oracles (Q1027973) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Filling the gap between voters and cryptography in e-voting (Q1028368) (← links)
- Zero-knowledge proofs of identity (Q1112785) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modifications (Q1344528) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- Batch RSA (Q1363068) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- On the hardness of the computational ring-LWR problem and its applications (Q1633465) (← links)
