The following pages link to (Q4409110):
Displaying 37 items.
- Efficient oblivious transfers with access control (Q453798) (← links)
- Efficient authenticated data structures for graph connectivity and geometric search problems (Q548654) (← links)
- A symmetric cryptographic scheme for data integrity verification in cloud databases (Q781030) (← links)
- Cryptanalysis of a dynamic universal accumulator over bilinear groups (Q826264) (← links)
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Group encryption: full dynamicity, message filtering and code-based instantiation (Q2061981) (← links)
- New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← links)
- New code-based cryptographic accumulator and fully dynamic group signature (Q2099154) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme (Q2149820) (← links)
- Security analysis of DGM and GM group signature schemes instantiated with XMSS-T (Q2151287) (← links)
- Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
- CPA-to-CCA transformation for KDM security (Q2175934) (← links)
- Foundations of fully dynamic group signatures (Q2210441) (← links)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease (Q2317863) (← links)
- List signature schemes (Q2489914) (← links)
- On the security of Miyaji et al. group signature scheme (Q2570798) (← links)
- Merkle trees optimized for stateless clients in bitcoin (Q2670863) (← links)
- KVaC: key-value commitments for blockchains and beyond (Q2691607) (← links)
- Circular security is complete for KDM security (Q2692344) (← links)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Foundations of Fully Dynamic Group Signatures (Q2822669) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Efficient Asynchronous Accumulators for Distributed PKI (Q2827725) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- Short Transitive Signatures for Directed Trees (Q2889993) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Traceable Identity-Based Group Signature (Q2956880) (← links)
- A General, Flexible and Efficient Proof of Inclusion and Exclusion (Q3073693) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Efficient code-based fully dynamic group signature scheme (Q6201340) (← links)
