scientific article; zbMATH DE number 1440068

Cited in

(25)

Adaptively secure distributed public-key systems.
Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
Non-interactive composition of sigma-protocols via Share-then-Hash
Acyclicity programming for sigma-protocols
Generic fully simulatable adaptive oblivious transfer
Secure authenticated comparisons
Simulatable adaptive oblivious transfer with statistical receiver's privacy
Ambiguous one-move nominative signature without random oracles
Zero-knowledge proofs of retrievability
Efficient Protocols for Set Membership and Range Proofs
Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
Which languages have 4-round zero-knowledge proofs?
Several cryptographic applications of \(\Sigma\)-protocol
A characterization of chameleon hash functions and new, efficient designs
New Constructions and Applications of Trapdoor DDH Groups
A framework for non-interactive instance-dependent commitment schemes (NIC)
Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
An efficient self-blindable attribute-based credential scheme
A Revocable Group Signature Scheme with Scalability from Simple Assumptions and Its Implementation
Selective delegation of attributes in mercurial signature credentials
CDS composition of multi-round protocols
Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
Hybrid zero-knowledge from garbled circuits
Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments

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 Q4950056)