Giulio Malavolta

According to our database1, Giulio Malavolta authored at least 56 papers between 2014 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Efficient CCA Timed Commitments in Class Groups.
IACR Cryptol. ePrint Arch., 2021

Everlasting UC Commitments from Fully Malicious PUFs.
IACR Cryptol. ePrint Arch., 2021

A Geometric Approach to Homomorphic Secret Sharing.
IACR Cryptol. ePrint Arch., 2021

Compact Ring Signatures from Learning With Errors.
IACR Cryptol. ePrint Arch., 2021

The Round Complexity of Quantum Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2021

Cryptocurrencies with Security Policies and Two-Factor Authentication.
IACR Cryptol. ePrint Arch., 2021

Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA.
IACR Cryptol. ePrint Arch., 2021

Unbounded Multi-Party Computation from Learning with Errors.
IACR Cryptol. ePrint Arch., 2021

Algebraic Restriction Codes and their Applications.
IACR Cryptol. ePrint Arch., 2021

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.
IACR Cryptol. ePrint Arch., 2021

Indistinguishability Obfuscation of Null Quantum Circuits and Applications.
CoRR, 2021

2020
PayMo: Payment Channels For Monero.
IACR Cryptol. ePrint Arch., 2020

Lockable Signatures for Blockchains: Scriptless Scripts for All Signatures.
IACR Cryptol. ePrint Arch., 2020

Verifiable Timed Signatures Made Practical.
IACR Cryptol. ePrint Arch., 2020

Circuit Privacy for Quantum Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2020

Statistical Zaps and New Oblivious Transfer Protocols.
IACR Cryptol. ePrint Arch., 2020

A Combinatorial Approach to Quantum Random Functions.
IACR Cryptol. ePrint Arch., 2020

Multi-Client Oblivious RAM with Poly-Logarithmic Communication.
IACR Cryptol. ePrint Arch., 2020

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices.
IACR Cryptol. ePrint Arch., 2020

Candidate iO from Homomorphic Encryption Schemes.
IACR Cryptol. ePrint Arch., 2020

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

Multikey FHE in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation in Constant Rounds.
CoRR, 2020

Multi-key Fully-Homomorphic Encryption in the Plain Model.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Minting Mechanism for Proof of Stake Blockchains.
Proceedings of the Applied Cryptography and Network Security, 2020

2019
Cryptographic Clocks and Applications.
PhD thesis, 2019

My Genome Belongs to Me: Controlling Third Party Computation on Genomic Data.
Proc. Priv. Enhancing Technol., 2019

Group ORAM for privacy and access control in outsourced personal records.
J. Comput. Secur., 2019

Homomorphic Time-Lock Puzzles and Applications.
IACR Cryptol. ePrint Arch., 2019

Succinct Arguments for Bilinear Group Arithmetic: Practical Structure-Preserving Cryptography.
IACR Cryptol. ePrint Arch., 2019

Arithmetic Garbling from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2019

Incremental Proofs of Sequential Work.
IACR Cryptol. ePrint Arch., 2019

Tight Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2019

Trapdoor Hash Functions and Their Applications.
IACR Cryptol. ePrint Arch., 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
IACR Cryptol. ePrint Arch., 2019

Laconic Conditional Disclosure of Secrets and Applications.
IACR Cryptol. ePrint Arch., 2019

Efficient Invisible and Unlinkable Sanitizable Signatures.
IACR Cryptol. ePrint Arch., 2019

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2019

Anonymous Multi-Hop Locks for Blockchain Scalability and Interoperability.
Proceedings of the 26th Annual Network and Distributed System Security Symposium, 2019

Subvector Commitments with Application to Succinct Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018
Functional Credentials.
Proc. Priv. Enhancing Technol., 2018

Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys.
IET Inf. Secur., 2018

Multi-Hop Locks for Secure, Privacy-Preserving and Interoperable Payment-Channel Networks.
IACR Cryptol. ePrint Arch., 2018

Homomorphic Secret Sharing for Low Degree Polynomials.
IACR Cryptol. ePrint Arch., 2018

Optimal Succinct Arguments via Hidden Order Groups.
IACR Cryptol. ePrint Arch., 2018

Minting Mechanisms for Blockchain - or - Moving from Cryptoassets to Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2018

2017
Switch Commitments: A Safety Switch for Confidential Transactions.
IACR Cryptol. ePrint Arch., 2017

Concurrency and Privacy with Payment-Channel Networks.
IACR Cryptol. ePrint Arch., 2017

Maliciously Secure Multi-Client ORAM.
IACR Cryptol. ePrint Arch., 2017

Subset Predicate Encryption and Its Applications.
Proceedings of the Cryptology and Network Security - 16th International Conference, 2017

Efficient Ring Signatures in the Standard Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks.
IACR Cryptol. ePrint Arch., 2016

2015
Privacy and Access Control for Outsourced Personal Records.
IACR Cryptol. ePrint Arch., 2015

Efficient Unlinkable Sanitizable Signatures from Signatures with Rerandomizable Keys.
IACR Cryptol. ePrint Arch., 2015

2014
Brief announcement: towards security and privacy for outsourced data in the multi-party setting.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014


  Loading...