Universally composable succinct vector commitments and applications
From MaRDI portal
Cites work
- A more complete analysis of the signal double ratchet algorithm
- A zero-one law for cryptographic complexity with respect to computational UC security
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Computationally Sound Proofs
- Concurrent general composition of secure protocols in the timing model
- Concurrently composable security with shielded super-polynomial simulators
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- scientific article; zbMATH DE number 2086716 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Interactive oracle proofs
- New notions of security: achieving universal composability without trusted setup
- New techniques for noninteractive zero-knowledge
- On Efficient Zero-Knowledge PCPs
- Perfect Non-interactive Zero Knowledge for NP
- Proofs of space
- Publicly verifiable proofs of sequential work
- Simple proofs of sequential work
- The random oracle methodology, revisited.
- The wonderful world of global random oracles
- Universal composition with global subroutines: capturing global setup within plain UC
- Universally composable -protocols in the global random-oracle model
- Universally Composable Authentication and Key-Exchange with Global PKI
- Universally composable security
- Universally composable two-party and multi-party secure computation
- zkSNARKs in the ROM with unconditional UC-security
This page was built for publication: Universally composable succinct vector commitments and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233249)
