Pages that link to "Item:Q3549097"
From MaRDI portal
The following pages link to Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security (Q3549097):
Displayed 11 items.
- Lossy trapdoor functions from homomorphic reproducible encryption (Q456129) (← links)
- A pseudorandom number generator based on worst-case lattice problems (Q1675485) (← links)
- Security under message-derived keys: signcryption in iMessage (Q2055665) (← links)
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation (Q2194864) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption (Q2790055) (← links)
- A public key cryptosystem and a signature scheme based on discrete logarithms (Q3689092) (← links)
- Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited (Q4916018) (← links)
- New multivariate-based certificateless hybrid signcryption scheme for multi-recipient (Q5260593) (← links)
- Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation (Q5854430) (← links)
- A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation (Q6108852) (← links)