scientific article; zbMATH DE number 1256680
From MaRDI portal
Publication:4230367
Cited in
(21)- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Stacked garbling for disjunctive zero-knowledge proofs
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Issuer-hiding attribute-based credentials
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- A second note on the feasibility of generalized universal composability
- Separating computational and statistical differential privacy in the client-server model
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model
- Off-line electronic cash based on secret-key certificates
- How to challenge and cast your e-vote
- Multi-theorem preprocessing NIZKs from lattices
- An algebraic framework for silent preprocessing with trustless setup and active security
- Updatable public-key encryption, revisited
- Amplification of non-interactive zero knowledge, revisited
- Malleable SNARKs and their applications
- Unclonable non-interactive zero-knowledge
- Title not available (Why is no real title available?)
- Cryptography in the multi-string model
- Balancing privacy and accountability in blockchain identity management
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230367)
