Pages that link to "Item:Q2181865"
From MaRDI portal
The following pages link to Batching techniques for accumulators with applications to IOPs and stateless blockchains (Q2181865):
Displaying 33 items.
- Cryptanalysis of a dynamic universal accumulator over bilinear groups (Q826264) (← links)
- Multi-party revocation in sovrin: performance through distributed trust (Q826287) (← links)
- A sub-linear lattice-based submatrix commitment scheme (Q831634) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- Compact zero-knowledge proofs for threshold ECDSA with trustless setup (Q2061931) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- SoK: communication across distributed ledgers (Q2147221) (← links)
- Efficient state management in distributed ledgers (Q2147249) (← links)
- Dynamic universal accumulator with batch update over bilinear groups (Q2152172) (← links)
- Merkle trees optimized for stateless clients in bitcoin (Q2670863) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- KVaC: key-value commitments for blockchains and beyond (Q2691607) (← links)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage (Q2692375) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Turn-based communication channels (Q2697935) (← links)
- A note on Low Order assumptions in RSA groups (Q5025952) (← links)
- UC Updatable Databases and Applications (Q5048962) (← links)
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
- Efficient verifiable delay functions (Q5919019) (← links)
- Non-malleable vector commitments via local equivocability (Q6054731) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups (Q6110377) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Bicorn: an optimistically efficient distributed randomness beacon (Q6573968) (← links)
- Limits on revocable proof systems, with implications for stateless blockchains (Q6573990) (← links)
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces (Q6604928) (← links)
- Zero-knowledge functional elementary databases (Q6604931) (← links)
- Efficient secure storage with version control and key rotation (Q6605322) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- Oblivious accumulators (Q6635766) (← links)
- Universal vector commitments (Q6660388) (← links)
