Rosario Gennaro

According to our database1, Rosario Gennaro authored at least 156 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Fast Multiparty Threshold ECDSA with Fast Trustless Setup.
IACR Cryptology ePrint Archive, 2019

2018
Lattice-Based zk-SNARKs from Square Span Programs.
IACR Cryptology ePrint Archive, 2018

Fine-Grained Secure Computation.
IACR Cryptology ePrint Archive, 2018

Fine-Grained Secure Computation.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Threshold Cryptosystems from Threshold Fully Homomorphic Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Lattice-Based zk-SNARKs from Square Span Programs.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

Fast Multiparty Threshold ECDSA with Fast Trustless Setup.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
A certificateless approach to onion routing.
Int. J. Inf. Sec., 2017

Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services.
IACR Cryptology ePrint Archive, 2017

A Lattice-Based Universal Thresholdizer for Cryptographic Systems.
IACR Cryptology ePrint Archive, 2017

Threshold Cryptosystems From Threshold Fully Homomorphic Encryption.
IACR Cryptology ePrint Archive, 2017

Homomorphic Secret Sharing from Paillier Encryption.
Proceedings of the Provable Security, 2017

Verifiable Outsourced Computation: A Survey.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Using Level-1 Homomorphic Encryption to Improve Threshold DSA Signatures for Bitcoin Wallet Security.
Proceedings of the Progress in Cryptology - LATINCRYPT 2017, 2017

Efficient Rational Proofs for Space Bounded Computations.
Proceedings of the Decision and Game Theory for Security - 8th International Conference, 2017

Escrow Protocols for Cryptocurrencies: How to Buy Physical Goods Using Bitcoin.
Proceedings of the Financial Cryptography and Data Security, 2017

Zero-Knowledge Contingent Payments Revisited: Attacks and Payments for Services.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
Automata Evaluation and Text Search Protocols with Simulation-Based Security.
J. Cryptology, 2016

Threshold-optimal DSA/ECDSA signatures and an application to Bitcoin wallet security.
IACR Cryptology ePrint Archive, 2016

Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security.
Proceedings of the Applied Cryptography and Network Security, 2016

2015
Algebraic (trapdoor) one-way functions: Constructions and applications.
Theor. Comput. Sci., 2015

Generalizing Homomorphic MACs for Arithmetic Circuits.
IACR Cryptology ePrint Archive, 2015

Sequentially Composable Rational Proofs.
Proceedings of the Decision and Game Theory for Security - 6th International Conference, 2015

Highly scalable verifiable encrypted search.
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

2014
Verifiable Computation over Encrypted Data in the Presence of Verification Queries.
IACR Cryptology ePrint Archive, 2014

Generalizing Homomorphic MACs for Arithmetic Circuits.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Efficiently Verifiable Computation on Encrypted Data.
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

Combating Insider Attacks in IEEE 802.11 Wireless Networks with Broadcast Encryption.
Proceedings of the 28th IEEE International Conference on Advanced Information Networking and Applications, 2014

2013
Fully non-interactive onion routing with forward secrecy.
Int. J. Inf. Sec., 2013

Off-line/on-line signatures revisited: a general unifying paradigm, efficient threshold variants and experimental results.
Int. J. Inf. Sec., 2013

Hardcore Predicates for a Diffie-Hellman Problem over Finite Fields.
IACR Cryptology ePrint Archive, 2013

Algebraic (Trapdoor) One-Way Functions and Their Applications.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

Quadratic Span Programs and Succinct NIZKs without PCPs.
Proceedings of the Advances in Cryptology, 2013

Hard-Core Predicates for a Diffie-Hellman Problem over Finite Fields.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Fully Homomorphic Message Authenticators.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Relations between the security models for certificateless encryption and ID-based key agreement.
Int. J. Inf. Sec., 2012

Fully Homomorphic Message Authenticators.
IACR Cryptology ePrint Archive, 2012

Quadratic Span Programs and Succinct NIZKs without PCPs.
IACR Cryptology ePrint Archive, 2012

Improved Publicly Verifiable Delegation of Large Polynomials and Matrix Computations.
IACR Cryptology ePrint Archive, 2012

Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications.
IACR Cryptology ePrint Archive, 2012

Computational Extractors and Pseudorandomness.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Publicly verifiable delegation of large polynomials and matrix computations, with applications.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Computational Extractors and Pseudorandomness.
IACR Cryptology ePrint Archive, 2011

Verifiable Delegation of Computation over Large Datasets.
IACR Cryptology ePrint Archive, 2011

Verifiable Delegation of Computation over Large Datasets.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

Fully Non-interactive Onion Routing with Forward-Secrecy.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
Identity-Based Key Exchange Protocols without Pairings.
Trans. Computational Science, 2010

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack.
J. Cryptology, 2010

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.
IACR Cryptology ePrint Archive, 2010

Automata Evaluation and Text Search Protocols with Simulation Based Security.
IACR Cryptology ePrint Archive, 2010

Secure Network Coding over the Integers.
Proceedings of the Public Key Cryptography, 2010

Text Search Protocols with Simulation Based Security.
Proceedings of the Public Key Cryptography, 2010

Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement.
Proceedings of the Pairing-Based Cryptography - Pairing 2010, 2010

Making the Diffie-Hellman Protocol Identity-Based.
Proceedings of the Topics in Cryptology, 2010

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers.
Proceedings of the Advances in Cryptology, 2010

Okamoto-Tanaka Revisited: Fully Authenticated Diffie-Hellman with Minimal Overhead.
Proceedings of the Applied Cryptography and Network Security, 8th International Conference, 2010

2009
New Approaches for Deniable Authentication.
J. Cryptology, 2009

Secure Network Coding Over the Integers.
IACR Cryptology ePrint Archive, 2009

More on Key Wrapping.
IACR Cryptology ePrint Archive, 2009

Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers.
IACR Cryptology ePrint Archive, 2009

Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement.
IACR Cryptology ePrint Archive, 2009

Making the Diffie-Hellman Protocol Identity-Based.
IACR Cryptology ePrint Archive, 2009

More on Key Wrapping.
Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

Certificateless onion routing.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Tag-KEM/DEM: A New Framework for Hybrid Encryption.
J. Cryptology, 2008

Strongly-Resilient and Non-Interactive Hierarchical Key-Agreement in MANETs.
IACR Cryptology ePrint Archive, 2008

Threshold RSA for Dynamic and Ad-Hoc Groups.
IACR Cryptology ePrint Archive, 2008

Faster and Shorter Password-Authenticated Key Exchange.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results.
Proceedings of the Public Key Cryptography, 2008

Threshold RSA for Dynamic and Ad-Hoc Groups.
Proceedings of the Advances in Cryptology, 2008

Strongly-Resilient and Non-interactive Hierarchical Key-Agreement in MANETs.
Proceedings of the Computer Security, 2008

2007
Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring.
Theor. Comput. Sci., 2007

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems.
J. Cryptology, 2007

Faster and Shorter Password-Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2007

Improved On-Line/Off-Line Threshold Signatures.
Proceedings of the Public Key Cryptography, 2007

2006
A framework for password-based authenticated key exchange1.
ACM Trans. Inf. Syst. Secur., 2006

Provably secure threshold password-authenticated key exchange.
J. Comput. Syst. Sci., 2006

Randomness in Cryptography.
IEEE Security & Privacy, 2006

Deniable Authentication and Key Exchange.
IACR Cryptology ePrint Archive, 2006

Independent Zero-Knowledge Sets.
IACR Cryptology ePrint Archive, 2006

Independent Zero-Knowledge Sets.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Deniable authentication and key exchange.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

2005
Bounds on the Efficiency of Generic Cryptographic Constructions.
SIAM J. Comput., 2005

An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem.
J. Cryptology, 2005

Secure multiplication of shared secrets in the exponent.
Inf. Process. Lett., 2005

New Approaches for Deniable Authentication.
IACR Cryptology ePrint Archive, 2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption.
IACR Cryptology ePrint Archive, 2005

Secure off-the-record messaging.
Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, 2005

Cramer-Damgård Signatures Revisited: Efficient Flat-Tree Signatures Based on Factoring.
Proceedings of the Public Key Cryptography, 2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM.
Proceedings of the Advances in Cryptology, 2005

New approaches for deniable authentication.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
A Note on An Encryption Scheme of Kurosawa and Desmedt.
IACR Cryptology ePrint Archive, 2004

Secure Hashed Diffie-Hellman over Non-DDH Groups.
IACR Cryptology ePrint Archive, 2004

Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering.
Proceedings of the Theory of Cryptography, First Theory of Cryptography Conference, 2004

Secure Hashed Diffie-Hellman over Non-DDH Groups.
Proceedings of the Advances in Cryptology, 2004

Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks.
Proceedings of the Advances in Cryptology, 2004

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes.
Proceedings of the Advances in Cryptology, 2004

Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices.
Proceedings of the Advances in Cryptology, 2004

2003
Secure Multiplication of Shared Secrets in the Exponent.
IACR Cryptology ePrint Archive, 2003

A Framework for Password-Based Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2003

Multi-Trapdoor Commitments and their Applications to Non-Malleable Protocols.
IACR Cryptology ePrint Archive, 2003

Lower bounds on the efficiency of encryption and digital signature schemes.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Provably Secure Threshold Password-Authenticated Key Exchange.
Proceedings of the Advances in Cryptology, 2003

A Framework for Password-Based Authenticated Key Exchange.
Proceedings of the Advances in Cryptology, 2003

Secure Applications of Pedersen's Distributed Key Generation Protocol.
Proceedings of the Topics in Cryptology, 2003

2002
Securing Threshold Cryptosystems against Chosen Ciphertext Attack.
J. Cryptology, 2002

Paillier's Trapdoor Function Hides up to O(n) Bits.
J. Cryptology, 2002

Cryptographic Algorithms for Multimedia Traffic.
Proceedings of the Foundations of Security Analysis and Design II, 2002

Cryptanalysis of a Pseudorandom Generator Based on Braid Groups.
Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

On 2-Round Secure Multiparty Computation.
Proceedings of the Advances in Cryptology, 2002

2001
How to Sign Digital Streams.
Inf. Comput., 2001

Robust Threshold DSS Signatures.
Inf. Comput., 2001

The round complexity of verifiable secret sharing and secure multicast.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

The Bit Security of Paillier's Encryption Scheme and Its Applications.
Proceedings of the Advances in Cryptology, 2001

Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Paillier's cryptosystem revisited.
Proceedings of the CCS 2001, 2001

2000
A Protocol to Achieve Independence in Constant Rounds.
IEEE Trans. Parallel Distrib. Syst., 2000

Secure distributed storage and retrieval.
Theor. Comput. Sci., 2000

RSA-Based Undeniable Signatures.
J. Cryptology, 2000

Robust and Efficient Sharing of RSA Functions.
J. Cryptology, 2000

New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications.
J. Comput. Syst. Sci., 2000

Lower Bounds on the Efficiency of Generic Cryptographic Constructions.
IACR Cryptology ePrint Archive, 2000

Lower Bounds on the Efficiency of Generic Cryptographic Constructions
Electronic Colloquium on Computational Complexity (ECCC), 2000

Color opponency watermarking scheme for digital images.
Proceedings of the Security and Watermarking of Multimedia Contents II, 2000

Lower Bounds on the Efficiency of Generic Cryptographic Constructions.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

Computing Inverses over a Shared Secret Modulus.
Proceedings of the Advances in Cryptology, 2000

An Improved Pseudo-random Generator Based on Discrete Log.
Proceedings of the Advances in Cryptology, 2000

IBM Comments.
Proceedings of the Third Advanced Encryption Standard Candidate Conference, 2000

1999
Secure Hash-and-Sign Signatures without the Random Oracle.
IACR Cryptology ePrint Archive, 1999

Robust Watermarking for Images Based on Color Manipulation.
Proceedings of the Information Hiding, Third International Workshop, 1999

Secure Distributed Key Generation for Discrete-Log Based Cryptosystems.
Proceedings of the Advances in Cryptology, 1999

Secure Hash-and-Sign Signatures Without the Random Oracle.
Proceedings of the Advances in Cryptology, 1999

Adaptive Security for Threshold Cryptosystems.
Proceedings of the Advances in Cryptology, 1999

1998
An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
IACR Cryptology ePrint Archive, 1998

Secure Distributed Storage and Retrieval.
IACR Cryptology ePrint Archive, 1998

Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Securing Threshold Cryptosystems against Chosen Ciphertext Attack.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

New Efficient and Secure Protocols for Verifiable Signature Sharing and Other Applications.
Proceedings of the Advances in Cryptology, 1998

An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products.
Proceedings of the CCS '98, 1998

1997
A secure and optimally efficient multi-authority election scheme.
European Transactions on Telecommunications, 1997

Two-phase cryptographic key recovery system.
Computers & Security, 1997

Secure Distributed Storage and Retrieval.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

A Secure and Optimally Efficient Multi-Authority Election Scheme.
Proceedings of the Advances in Cryptology, 1997

How to Sign Digital Streams.
Proceedings of the Advances in Cryptology, 1997

RSA-Based Undeniable Signatures.
Proceedings of the Advances in Cryptology, 1997

1996
Theory and practice of verifiable secret sharing.
PhD thesis, 1996

Incoercible Multiparty Computation.
IACR Cryptology ePrint Archive, 1996

Incoercible Multiparty Computation (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Robust Threshold DSS Signatures.
Proceedings of the Advances in Cryptology, 1996

Robust and Efficient Sharing of RSA Functions.
Proceedings of the Advances in Cryptology, 1996

Probabilistic Verification of Elementary Geometry Statements.
Proceedings of the Automated Deduction in Geometry, 1996

1995
Achieving Independence Efficiently and Securely.
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Verifiable Secret Sharing as Secure Computation.
Proceedings of the Advances in Cryptology, 1995

On Learning from Noisy and Incomplete Examples.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995


  Loading...