Efficient maliciously secure oblivious exponentiations
From MaRDI portal
Cites work
- A Note on Chosen-Basis Decisional Diffie-Hellman Assumptions
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - CRYPTO 2003
- Automated analysis of cryptographic assumptions in generic group models
- Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- scientific article; zbMATH DE number 1303126 (Why is no real title available?)
- scientific article; zbMATH DE number 1304081 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- Public Key Cryptography - PKC 2005
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Short signatures from the Weil pairing
- The wonderful world of global random oracles
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Two-sided malicious security for private intersection-sum with cardinality
- Universally composable security: a new paradigm for cryptographic protocols
This page was built for publication: Efficient maliciously secure oblivious exponentiations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326385)
