The following pages link to Giulio Malavolta (Q1703917):
Displayed 48 items.
- Efficient ring signatures in the standard model (Q1703919) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Multi-key fully-homomorphic encryption in the plain model (Q2055713) (← links)
- Constant ciphertext-rate non-committing encryption from standard assumptions (Q2055714) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Tight verifiable delay functions (Q2106631) (← links)
- Compact ring signatures from learning with errors (Q2120080) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Arithmetic garbling from bilinear maps (Q2167776) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Rate-1 trapdoor functions from the Diffie-Hellman problem (Q2178868) (← links)
- Subvector commitments with application to succinct arguments (Q2181864) (← links)
- Homomorphic time-lock puzzles and applications (Q2181867) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Efficient invisible and unlinkable sanitizable signatures (Q2289208) (← links)
- Incremental proofs of sequential work (Q2292874) (← links)
- Trapdoor hash functions and their applications (Q2304914) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- A combinatorial approach to quantum random functions (Q2692397) (← links)
- The round complexity of quantum zero-knowledge (Q2695629) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
- Efficient laconic cryptography from learning with errors (Q6063527) (← links)
- Multi-key and multi-input predicate encryption from learning with errors (Q6063533) (← links)
- Algebraic restriction codes and their applications (Q6066762) (← links)
- Laconic function evaluation for Turing machines (Q6067382) (← links)
- Transparent batchable time-lock puzzles and applications to Byzantine consensus (Q6070776) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Succinct classical verification of quantum computation (Q6104334) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- A note on the post-quantum security of (ring) signatures (Q6113964) (← links)
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols (Q6114234) (← links)
- (Q6126222) (← links)
- (Q6126225) (← links)
- (Q6126239) (← links)
- (Q6126290) (← links)
- How to build a trapdoor function from an encryption scheme (Q6157550) (← links)
- Subset predicate encryption and its applications (Q6166068) (← links)
- Quantum rewinding for many-round protocols (Q6169349) (← links)
- Steganography-free zero-knowledge (Q6169351) (← links)
- Lattice-based succinct arguments from vanishing polynomials (extended abstract) (Q6186698) (← links)
- On concurrent multi-party quantum computation (Q6190133) (← links)
- Lattice-based timed cryptography (Q6190157) (← links)