Verifiable encryption from MPC-in-the-head
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- A modular analysis of the Fujisaki-Okamoto transformation
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part III
- Auto-recoverable auto-certifiable cryptosystems
- Banquet: short and fast signatures from AES
- BBQ: using AES in Picnic signatures
- Computationally Sound Proofs
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Constructing non-malleable commitments: a black-box approach
- Efficient signature generation by smart cards
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Fair encryption of RSA keys
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1583789 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1341866 (Why is no real title available?)
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- McFly: verifiable encryption to the future made practical
- On the size of pairing-based non-interactive arguments
- One-shot verifiable encryption from lattices
- Online-extractability in the quantum random-oracle model
- Optimal security proofs for signatures from identification schemes
- Optimistic fair exchange of digital signatures
- Perfect Non-interactive Zero Knowledge for NP
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Publicly verifiable secret sharing
- Ring signatures: Stronger definitions, and constructions without random oracles
- Round optimal black-box ``commit-and-prove
- Round-optimal black-box commit-and-prove with succinct communication
- Secure integration of asymmetric and symmetric encryption schemes
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Threshold linear secret sharing to the rescue of MPC-in-the-head
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Verifiable encryption from MPC-in-the-head
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318550)
