Giovanni Di Crescenzo

According to our database1, Giovanni Di Crescenzo authored at least 134 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Secure Delegation to a Single Malicious Server: Exponentiation in RSA-type Groups.
Proceedings of the 7th IEEE Conference on Communications and Network Security, 2019

2018
Intrusion-Resilient Classifier Approximation: From Wildcard Matching to Range Membership.
Proceedings of the 17th IEEE International Conference On Trust, 2018

Efficient and Secure Delegation to a Single Malicious Server: Exponentiation over Non-abelian Groups.
Proceedings of the Mathematical Software - ICMS 2018, 2018

Cryptographic Password Obfuscation.
Proceedings of the Information and Communications Security - 20th International Conference, 2018

Cryptographic Formula Obfuscation.
Proceedings of the Foundations and Practice of Security - 11th International Symposium, 2018

Runtime Attestation for IAAS Clouds.
Proceedings of the 8th International Conference on Cloud Computing and Services Science, 2018

2017
Implementing Conjunction Obfuscation under Entropic Ring LWE.
IACR Cryptology ePrint Archive, 2017

Practical Implementation of Lattice-Based Program Obfuscators for Point Functions.
Proceedings of the 2017 International Conference on High Performance Computing & Simulation, 2017

Privacy-Preserving Deterministic Automata Evaluation with Encrypted Data Blocks.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2017

Computing multiple exponentiations in discrete log and RSA groups: From batch verification to batch delegation.
Proceedings of the 2017 IEEE Conference on Communications and Network Security, 2017

Boolean Circuit Camouflage: Cryptographic Models, Limitations, Provable Results and a Random Oracle Realization.
Proceedings of the 2017 Workshop on Attacks and Solutions in Hardware Security, 2017

Practical and Secure Outsourcing of Discrete Log Group Exponentiation to a Single Malicious Server.
Proceedings of the 9th Cloud Computing Security Workshop, 2017

2016
Practical and privacy-preserving information retrieval from a database table.
Journal of Computer Security, 2016

Practical implementations of program obfuscators for point functions.
Proceedings of the International Conference on High Performance Computing & Simulation, 2016

Enhanced Functionality and Confidentiality for Database Search and Publish/Subscribe Protocols.
Proceedings of the Data and Applications Security and Privacy XXX, 2016

Server-assisted fully homomorphic computation protocols.
Proceedings of the 2016 IEEE Conference on Communications and Network Security, 2016

2015
Efficient and Secure Delegation of Group Exponentiation to a Single Server.
IACR Cryptology ePrint Archive, 2015

Foundations of Optical Encryption: A Candidate Short-Key Scheme.
Proceedings of the Network and System Security - 9th International Conference, 2015

Efficient Computations over Encrypted Data Blocks.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Privacy-Preserving Range Queries from Keyword Queries.
Proceedings of the Data and Applications Security and Privacy XXIX, 2015

2014
Practical and Privacy-Preserving Policy Compliance for Outsourced Data.
Proceedings of the Financial Cryptography and Data Security, 2014

On Minimizing the Size of Encrypted Databases.
Proceedings of the Data and Applications Security and Privacy XXVIII, 2014

Practical Private Information Retrieval from a Time-Varying, Multi-attribute, and Multiple-Occurrence Database.
Proceedings of the Data and Applications Security and Privacy XXVIII, 2014

2013
Efficient and Private Three-Party Publish/Subscribe.
Proceedings of the Network and System Security - 7th International Conference, 2013

Privacy-Preserving Publish/Subscribe: Efficient Protocols in a Distributed Model.
Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2013

2012
Zero-Knowledge Proofs via Polynomial Representations.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Privacy-preserving PKIs with reduced server trust.
Proceedings of IEEE International Conference on Communications, 2012

Concrete synthetic modeling of vehicular networks as random geometric graphs.
Proceedings of IEEE International Conference on Communications, 2012

2011
Anonymity notions and techniques for public-key infrastructures in vehicular networks.
Security and Communication Networks, 2011

Detecting Anomalies in Active Insider Stepping Stone Attacks.
JoWUA, 2011

A Group Testing Approach to Improved Corruption Localizing Hashing.
IACR Cryptology ePrint Archive, 2011

Data Forensics Constructions from Cryptographic Hashing and Coding.
Proceedings of the Digital Forensics and Watermarking - 10th International Workshop, 2011

Combinatorial Group Testing for Corruption Localizing Hashing.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
On server trust in private proxy auctions.
Electronic Commerce Research, 2010

Non-interactive malicious behavior detection in vehicular networks.
Proceedings of the Second IEEE Vehicular Networking Conference, 2010

Analysis of Certificate Revocation List Distribution Protocols for Vehicular Networks.
Proceedings of the Global Communications Conference, 2010

Efficient CRL search in vehicular network PKIS.
Proceedings of the 6th Workshop on Digital Identity Management, 2010

2009
Halftone visual cryptography via error diffusion.
IEEE Trans. Information Forensics and Security, 2009

Hypergraph decomposition and secret sharing.
Discrete Applied Mathematics, 2009

Social Network Privacy via Evolving Access Control.
Proceedings of the Wireless Algorithms, 2009

Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Corruption-Localizing Hashing.
Proceedings of the Computer Security, 2009

Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model.
Proceedings of the Computer Science, 2009

Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
On Monotone Formula Composition of Perfect Zero-Knowledge Languages.
SIAM J. Comput., 2008

A secure virtual point of service for purchasing digital media content over 3G wireless networks.
Security and Communication Networks, 2008

Preface.
Electr. Notes Theor. Comput. Sci., 2008

An Overlay Photonic Layer Security Approach Scalable to 100 Gb/s.
IEEE Communications Magazine, 2008

On the Security of Beth's Identification Schemes against Active and Concurrent Adversaries.
Proceedings of the Mathematical Methods in Computer Science, 2008

On the Statistical Dependency of Identity Theft on Demographics.
Proceedings of the Protecting Persons While Protecting the People, 2008

3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Succinct NP Proofs from an Extractability Assumption.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Preface.
Electr. Notes Theor. Comput. Sci., 2007

Secure Node Discovery in Ad-hoc Networks and Applications.
Electr. Notes Theor. Comput. Sci., 2007

Threshold cryptography in mobile ad hoc networks under minimal topology and setup assumptions.
Ad Hoc Networks, 2007

Anonymity Notions for Public-Key Infrastructures in Mobile Vehicular Networks.
Proceedings of the IEEE 4th International Conference on Mobile Adhoc and Sensor Systems, 2007

Public Key Encryption with Searchable Keywords Based on Jacobi Symbols.
Proceedings of the Progress in Cryptology, 2007

On Defining Proofs of Knowledge in the Bare Public Key Model.
Proceedings of the Theoretical Computer Science, 10th Italian Conference, 2007

Modeling cryptographic properties of voice and voice-based entity authentication.
Proceedings of the 2007 Workshop on Digital Identity Management, 2007

2006
Halftone visual cryptography.
IEEE Trans. Image Processing, 2006

Approximate Message Authentication Codes for N-ary Alphabets.
IEEE Trans. Information Forensics and Security, 2006

Securing reliable server pooling in MANET against byzantine adversaries.
IEEE Journal on Selected Areas in Communications, 2006

Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model.
IACR Cryptology ePrint Archive, 2006

Securing Weakly-Dominating Virtual Backbones in Mobile Ad Hoc Networks.
Proceedings of the 2006 International Symposium on a World of Wireless, 2006

Cryptographic hashing for virus localization.
Proceedings of the 2006 ACM Workshop on Rapid Malcode, 2006

Perfectly Secure Password Protocols in the Bounded Retrieval Model.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Modeling key agreement in multi-hop ad hoc networks.
Proceedings of the International Conference on Wireless Communications and Mobile Computing, 2006

Halftone visual cryptography via direct binary search.
Proceedings of the 14th European Signal Processing Conference, 2006

2005
Security of erasable memories against adaptive adversaries.
Proceedings of the 2005 ACM Workshop On Storage Security And Survivability, 2005

Improved topology assumptions for threshold cryptography in mobile ad hoc networks.
Proceedings of the 3rd ACM Workshop on Security of ad hoc and Sensor Networks, 2005

InFilter: Predictive Ingress Filtering to Detect Spoofed IP Traffic.
Proceedings of the 25th International Conference on Distributed Computing Systems Workshops (ICDCS 2005 Workshops), 2005

Concurrent Zero Knowledge in the Public-Key Model.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Asynchronous Perfectly Secure Communication over One-Time Pads.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Approximate Message Authentication and Biometric Entity Authentication.
Proceedings of the Financial Cryptography and Data Security, 2005

Towards a Theory of Intrusion Detection.
Proceedings of the Computer Security, 2005

You Can Prove So Many Things in Zero-Knowledge.
Proceedings of the Information Security and Cryptology, First SKLOIS Conference, 2005

Contemporary cryptology.
Advanced courses in mathematics : CRM Barcelona, Birkhäuser, ISBN: 978-3-7643-7294-1, 2005

2004
Reducing Server Trust in Private Proxy Auctions.
Proceedings of the Trust and Privacy in Digital Business, First International Conference, 2004

Threshold Cryptography for Mobile Ad Hoc Networks.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Design and analysis of DBMAC, an error localizing message authentication code.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model.
Proceedings of the Advances in Cryptology, 2004

Visual cryptography via halftoning.
Proceedings of the Color Imaging IX: Processing, Hardcopy, and Applications, San Jose, 2004

Improved Setup Assumptions for 3-Round Resettable Zero Knowledge.
Proceedings of the Advances in Cryptology, 2004

2003
Sharing one secret vs. sharing many secrets.
Theor. Comput. Sci., 2003

Public Key Encryption with keyword Search.
IACR Cryptology ePrint Archive, 2003

2002
Efficient Re-keying Protocols for Multicast Encryption.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Equivocable and Extractable Commitment Schemes.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Randomness-Optimal Characterization of Two NP Proof Systems.
Proceedings of the Randomization and Approximation Techniques, 6th International Workshop, 2002

Efficiently providing secure multimedia conferencing in SEC.
Proceedings of the IEEE International Conference on Communications, 2002

2001
Universal Service-Providers for Private Information Retrieval.
J. Cryptology, 2001

Efficient and Non-Interactive Non-Malleable Commitment.
IACR Cryptology ePrint Archive, 2001

Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Efficient Kerberized Multicast in a Practical Distributed Setting.
Proceedings of the Information Security, 4th International Conference, 2001

Privacy for the Stock Market.
Proceedings of the Financial Cryptography, 2001

Robust Non-interactive Zero Knowledge.
Proceedings of the Advances in Cryptology, 2001

2000
On zero-knowledge proofs (extended abstract): "from membership to decision".
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Sharing one secret vs. sharing many secrets: tight bounds on the average improvement ratio.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Private Selective Payment Protocols.
Proceedings of the Financial Cryptography, 2000

Single Database Private Information Retrieval Implies Oblivious Transfer.
Proceedings of the Advances in Cryptology, 2000

Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Sharing Block Ciphers.
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof.
Inf. Process. Lett., 1999

Security-Preserving Hardness-Amplification for Any Regular One-Way Function.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

How to Forget a Secret.
Proceedings of the STACS 99, 1999

Existence of Multiplicative Secret Sharing Schemes with Polynomial Share Expansion.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP.
Proceedings of the Automata, 1999

Conditional Oblivious Transfer and Timed-Release Encryption.
Proceedings of the Advances in Cryptology, 1999

On Concurrent Zero-Knowledge with Pre-processing.
Proceedings of the Advances in Cryptology, 1999

1998
Universal Service Providers for Database Private Information Retrieval.
IACR Cryptology ePrint Archive, 1998

Security amplification by composition: The case of doubly-iterated, ideal ciphers.
IACR Cryptology ePrint Archive, 1998

The Graph Clustering Problem has a Perfect Zero-Knowledge Proof
Electronic Colloquium on Computational Complexity (ECCC), 1998

Non-Interactive and Non-Malleable Commitment.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols.
Proceedings of the STACS 98, 1998

Universal Service-Providers for Database Private Information Retrieval (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Image Density is Complete for Non-Interactive-SZK (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

Proofs of Membership vs. Proofs of Knowledge.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

Communication-Efficient Anonymous Group Identification.
Proceedings of the CCS '98, 1998

1997
Zero-knowledge proofs of decision power: new protocols and optimal round-complexity.
Proceedings of the Information and Communication Security, First International Conference, 1997

Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract).
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Keeping the SZK-Verifier Honest Unconditionally.
Proceedings of the Advances in Cryptology, 1997

1995
Zero-Knowledge Arguments and Public-Key Cryptography
Inf. Comput., August, 1995

Anonymous NIZK Proofs of Knowledge with Preprocessing.
Proceedings of the Advances in Cryptology, 1995

Recycling Random Bits in Composed Perfect Zero-Knowledge.
Proceedings of the Advances in Cryptology, 1995

1994
The Knowledge Complexity of Quadratic Residuosity Languages.
Theor. Comput. Sci., 1994

Round-Optimal Perfect Zero-Knowledge Proofs.
Inf. Process. Lett., 1994

On Monotone Formula Closure of SZK
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Methodology for Digital Money based on General Cryptographic Tools.
Proceedings of the Advances in Cryptology, 1994

Multi-Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1994

A Non-Iterative Electronic Cash System.
Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

1993
Secret Sharing and Perfect Zero Knowledge.
Proceedings of the Advances in Cryptology, 1993


  Loading...