The following pages link to (Q4230367):
Displayed 16 items.
- Cryptography in the multi-string model (Q744350) (← links)
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Issuer-hiding attribute-based credentials (Q2149822) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- A second note on the feasibility of generalized universal composability (Q3130297) (← links)
- Separating Computational and Statistical Differential Privacy in the Client-Server Model (Q3179372) (← links)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures (Q3392908) (← links)
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor (Q3600328) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Off-line electronic cash based on secret-key certificates (Q5096329) (← links)
- How to Challenge and Cast Your e-Vote (Q5857773) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)