Mihir Bellare

According to our database1, Mihir Bellare authored at least 206 papers between 1988 and 2020.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2013, "For contributions to provable security methods supporting high-quality, cost-effective cryptography.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Security under Message-Derived Keys: Signcryption in iMessage.
IACR Cryptol. ePrint Arch., 2020

Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements.
IACR Cryptol. ePrint Arch., 2020

Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability.
IACR Cryptol. ePrint Arch., 2020

The Multi-Base Discrete Logarithm Problem: Concrete Security Improvements for Schnorr Identification, Signatures and Multi-Signatures.
IACR Cryptol. ePrint Arch., 2020

Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer.
IACR Cryptol. ePrint Arch., 2020

2019
Nonces are Noticed: AEAD Revisited.
IACR Cryptol. ePrint Arch., 2019

The Local Forking Lemma and its Application to Deterministic Encryption.
IACR Cryptol. ePrint Arch., 2019

2018
Robust Encryption.
J. Cryptology, 2018

Better Than Advertised: Improved Collision-Resistance Guarantees for MD-Based Hash Functions.
IACR Cryptol. ePrint Arch., 2018

Defending Against Key Exfiltration: Efficiency Improvements for Big-Key Cryptography via Large-Alphabet Subkey Prediction.
IACR Cryptol. ePrint Arch., 2018

The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants.
IACR Cryptol. ePrint Arch., 2018

Public-Key Encryption Resistant to Parameter Subversion and its Realization from Efficiently-Embeddable Groups.
IACR Cryptol. ePrint Arch., 2018

2017
Forward-Security under Continual Leakage.
IACR Cryptol. ePrint Arch., 2017

Identity-Based Format-Preserving Encryption.
IACR Cryptol. ePrint Arch., 2017

2016
The Multi-User Security of Authenticated Encryption: AES-GCM in TLS 1.3.
IACR Cryptol. ePrint Arch., 2016

Nonce-Based Cryptography: Retaining Security when Randomness Fails.
IACR Cryptol. ePrint Arch., 2016

New Negative Results on Differing-Inputs Obfuscation.
IACR Cryptol. ePrint Arch., 2016

Ratcheted Encryption and Key Exchange: The Security of Messaging.
IACR Cryptol. ePrint Arch., 2016

Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures.
IACR Cryptol. ePrint Arch., 2016

Big-Key Symmetric Encryption: Resisting Key Exfiltration.
IACR Cryptol. ePrint Arch., 2016

Message-recovery attacks on Feistel-based Format Preserving Encryption.
IACR Cryptol. ePrint Arch., 2016

NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion.
IACR Cryptol. ePrint Arch., 2016

Hash-Function based PRFs: AMAC and its Multi-User Security.
IACR Cryptol. ePrint Arch., 2016

From Identification to Signatures, Tightly: A Framework and Generic Transforms.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed?
J. Cryptology, 2015

New Proofs for NMAC and HMAC: Security without Collision Resistance.
J. Cryptology, 2015

Contention in Cryptoland: Obfuscation, Leakage and UCE.
IACR Cryptol. ePrint Arch., 2015

Double-Authentication-Preventing Signatures from Trapdoor Identification.
IACR Cryptol. ePrint Arch., 2015

Point-Function Obfuscation: A Framework and Generic Constructions.
IACR Cryptol. ePrint Arch., 2015

Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of an HMAC Assumption.
IACR Cryptol. ePrint Arch., 2015

Interactive Message-Locked Encryption and Secure Deduplication.
IACR Cryptol. ePrint Arch., 2015

Mass-surveillance without the State: Strongly Undetectable Algorithm-Substitution Attacks.
IACR Cryptol. ePrint Arch., 2015

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
A Characterization of Chameleon Hash Functions and New, Efficient Designs.
J. Cryptology, 2014

Security of Symmetric Encryption against Mass Surveillance.
IACR Cryptol. ePrint Arch., 2014

Cryptography from Compression Functions: The UCE Bridge to the ROM.
IACR Cryptol. ePrint Arch., 2014

UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

How Secure is Deterministic Encryption?
IACR Cryptol. ePrint Arch., 2014

Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Poly-Many Hardcore Bits for Any One-Way Function.
IACR Cryptol. ePrint Arch., 2013

Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig.
IACR Cryptol. ePrint Arch., 2013

DupLESS: Server-Aided Encryption for Deduplicated Storage.
IACR Cryptol. ePrint Arch., 2013

Efficient Garbling from a Fixed-Key Blockcipher.
IACR Cryptol. ePrint Arch., 2013

Instantiating Random Oracles via UCEs.
IACR Cryptol. ePrint Arch., 2013

Adaptive Witness Encryption and Asymmetric Password-based Cryptography.
IACR Cryptol. ePrint Arch., 2013

Policy-Based Signatures.
IACR Cryptol. ePrint Arch., 2013

2012
On-line Ciphers and the Hash-CBC Constructions.
J. Cryptology, 2012

A Cryptographic Treatment of the Wiretap Channel.
IACR Cryptol. ePrint Arch., 2012

Multi-Instance Security and its Application to Password-Based Cryptography.
IACR Cryptol. ePrint Arch., 2012

Polynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity.
IACR Cryptol. ePrint Arch., 2012

RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures.
IACR Cryptol. ePrint Arch., 2012

Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition.
IACR Cryptol. ePrint Arch., 2012

Message-Locked Encryption and Secure Deduplication.
IACR Cryptol. ePrint Arch., 2012

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing.
IACR Cryptol. ePrint Arch., 2012

Garbling Schemes.
IACR Cryptol. ePrint Arch., 2012

Hedged Public-key Encryption: How to Protect against Bad Randomness.
IACR Cryptol. ePrint Arch., 2012

Semantic Security for the Wiretap Channel.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Foundations of garbled circuits.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Identity-Based (Lossy) Trapdoor Functions and Applications.
IACR Cryptol. ePrint Arch., 2011

Authenticated and Misuse-Resistant Encryption of Key-Dependent Data.
IACR Cryptol. ePrint Arch., 2011

Standard Security Does Not Imply Security Against Selective-Opening.
IACR Cryptol. ePrint Arch., 2011

Cryptography Secure Against Related-Key Attacks and Tampering.
IACR Cryptol. ePrint Arch., 2011

Ciphers that Securely Encipher their own Keys.
IACR Cryptol. ePrint Arch., 2011

On Probabilistic versus Deterministic Provers in the Definition of Proofs of Knowledge.
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

Proving Computational Ability.
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011

2010
Identity-Based Encryption Secure against Selective Opening Attack.
IACR Cryptol. ePrint Arch., 2010

Pseudorandom Functions and Permutations Provably Secure Against Related-Key Attacks.
IACR Cryptol. ePrint Arch., 2010

Cryptographic Agility and its Relation to Circular Encryption.
IACR Cryptol. ePrint Arch., 2010

2009
Security Proofs for Identity-Based Identification and Signature Schemes.
J. Cryptology, 2009

Encryption Schemes Secure under Selective Opening Attack.
IACR Cryptol. ePrint Arch., 2009

Format-Preserving Encryption.
IACR Cryptol. ePrint Arch., 2009

Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters' IBE Scheme.
IACR Cryptol. ePrint Arch., 2009

Key Insulation and Intrusion Resilience Over a Public Channel.
IACR Cryptol. ePrint Arch., 2009

Partial Signatures and their Applications.
IACR Cryptol. ePrint Arch., 2009

Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening.
Proceedings of the Advances in Cryptology, 2009

2008
From Identification to Signatures Via the Fiat-Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security.
IEEE Trans. Inf. Theory, 2008

Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm.
J. Cryptology, 2008

Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions.
J. Cryptology, 2008

Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures.
IET Information Security, 2008

Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles.
IACR Cryptol. ePrint Arch., 2008

Hash Functions from Sigma Protocols and Improvements to VSH.
Proceedings of the Advances in Cryptology, 2008

2007
Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security.
IEEE Trans. Inf. Theory, 2007

Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir without Random Oracles.
IACR Cryptol. ePrint Arch., 2007

Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms.
IACR Cryptol. ePrint Arch., 2007

Identity-Based Multi-signatures from RSA.
Proceedings of the Topics in Cryptology, 2007

2006
The Secure Shell (SSH) Transport Layer Encryption Modes.
RFC, January, 2006

Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization.
IACR Cryptol. ePrint Arch., 2006

Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals.
IACR Cryptol. ePrint Arch., 2006

Multi-Property-Preserving Hash Domain Extension and the EMD Transform.
IACR Cryptol. ePrint Arch., 2006

Unrestricted Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2006

Stateful Public-Key Cryptosystems: How to Encrypt with One 160-bit Exponentiation.
IACR Cryptol. ePrint Arch., 2006

Deterministic and Efficiently Searchable Encryption.
IACR Cryptol. ePrint Arch., 2006

On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold.
Appl. Algebra Eng. Commun. Comput., 2006

The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs.
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006

Multi-signatures in the plain public-Key model and a general forking lemma.
Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, Ioctober 30, 2006

2005
HOTP: An HMAC-Based One-Time Password Algorithm.
RFC, December, 2005

Transitive signatures: new schemes and proofs.
IEEE Trans. Inf. Theory, 2005

Improved Security Analyses for CBC MACs.
Proceedings of the Advances in Cryptology, 2005

2004
Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the Encode-then-Encrypt-and-MAC paradigm.
ACM Trans. Inf. Syst. Secur., 2004

Foundations of Group Signatures: The Case of Dynamic Groups.
IACR Cryptol. ePrint Arch., 2004

Code-Based Game-Playing Proofs and the Security of Triple Encryption.
IACR Cryptol. ePrint Arch., 2004

Towards Plaintext-Aware Public-Key Encryption without Random Oracles.
IACR Cryptol. ePrint Arch., 2004

The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2004

The Power of Verification Queries in Message Authentication and Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2004

The EAX Mode of Operation.
Proceedings of the Fast Software Encryption, 11th International Workshop, 2004

2003
OCB: A block-cipher mode of operation for efficient authenticated encryption.
ACM Trans. Inf. Syst. Secur., 2003

The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme.
J. Cryptology, 2003

EAX: A Conventional Authenticated-Encryption Mode.
IACR Cryptol. ePrint Arch., 2003

Hash Function Balance and its Impact on Birthday Attacks.
IACR Cryptol. ePrint Arch., 2003

An Uninstantiable Random-Oracle-Model Scheme for a Hybrid Encryption Problem.
IACR Cryptol. ePrint Arch., 2003

Randomness Re-use in Multi-recipient Encryption Schemeas.
Proceedings of the Public Key Cryptography, 2003

Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions.
Proceedings of the Advances in Cryptology, 2003

A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications.
Proceedings of the Advances in Cryptology, 2003

2002
A Note on Negligible Functions.
J. Cryptology, 2002

From Identification to Signatures via the Fiat-Shamir Transform: Minimizing Assumptions for Security and Forward-Security.
IACR Cryptol. ePrint Arch., 2002

GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks.
Proceedings of the Advances in Cryptology, 2002

Authenticated encryption in SSH: provably fixing the SSH binary packet protocol.
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002

Transitive Signatures Based on Factoring and RSA.
Proceedings of the Advances in Cryptology, 2002

2001
OCB Mode.
IACR Cryptol. ePrint Arch., 2001

Forward-Security in Private-Key Cryptography.
IACR Cryptol. ePrint Arch., 2001

The Security of Practical Two-Party RSA Signature Schemes.
IACR Cryptol. ePrint Arch., 2001

The Power of RSA Inversion Oracles and the Security of Chaum's RSA-Based Blind Signature Scheme.
Proceedings of the Financial Cryptography, 2001

Does Encryption with Redundancy Provide Authenticity?
Proceedings of the Advances in Cryptology, 2001

The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES.
Proceedings of the Topics in Cryptology, 2001

Online Ciphers and the Hash-CBC Construction.
Proceedings of the Advances in Cryptology, 2001

OCB: a block-cipher mode of operation for efficient authenticated encryption.
Proceedings of the CCS 2001, 2001

Key-Privacy in Public-Key Encryption.
Proceedings of the Advances in Cryptology, 2001

2000
Design, implementation, and deployment of the iKP secure electronic payment system.
IEEE J. Sel. Areas Commun., 2000

The Security of the Cipher Block Chaining Message Authentication Code.
J. Comput. Syst. Sci., 2000

Authenticated Key Exchange Secure Against Dictionary Attacks.
IACR Cryptol. ePrint Arch., 2000

Identification Protocols Secure Against Reset Attacks.
IACR Cryptol. ePrint Arch., 2000

The Security of Chaffing and Winnowing.
IACR Cryptol. ePrint Arch., 2000

Public-Key Encryption in a Multi-user Setting: Security Proofs and Improvements.
Proceedings of the Advances in Cryptology, 2000

Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography.
Proceedings of the Advances in Cryptology, 2000

Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques.
Proceedings of the Advances in Cryptology, 2000

1999
Translucent Cryptography - An Alternative to Key Escrow, and Its Implementation via Fractional Oblivious Transfer.
J. Cryptology, 1999

A forward-secure digital signature scheme.
IACR Cryptol. ePrint Arch., 1999

A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion.
IACR Cryptol. ePrint Arch., 1999

DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem.
IACR Cryptol. ePrint Arch., 1999

On the Construction of Variable-Input-Length Ciphers.
Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

Stateless Evaluation of Pseudorandom Functions: Security beyond the Birthday Barrier.
Proceedings of the Advances in Cryptology, 1999

Constructing VIL-MACsfrom FIL-MACs: Message Authentication under Weakened Assumptions.
Proceedings of the Advances in Cryptology, 1999

1998
Free Bits, PCPs, and Nonapproximability-Towards Tight Results.
SIAM J. Comput., 1998

On Chromatic Sums and Distributed Resource Allocation.
Inf. Comput., 1998

Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems.
IACR Cryptol. ePrint Arch., 1998

Fast Batch Verification for Modular Exponentiation and Digital Signatures.
IACR Cryptol. ePrint Arch., 1998

Relations among Notions of Security for Public-Key Encryption Schemes.
IACR Cryptol. ePrint Arch., 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
IACR Cryptol. ePrint Arch., 1998

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

Uniform Generation of NP-witnesses using an NP-oracle.
Electronic Colloquium on Computational Complexity (ECCC), 1998

VarietyCash: A Multi-Purpose Electronic Payment System.
Proceedings of the 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, August 31, 1998

A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract).
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Batch Verification with Applications to Cryptography and Checking.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

Luby-Rackoff Backwards: Increasing Security by Making Block Ciphers Non-invertible.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems.
Proceedings of the Advances in Cryptology, 1998

Practice-Oriented Provable Security.
Proceedings of the Lectures on Data Security, 1998

1997
HMAC: Keyed-Hashing for Message Authentication.
RFC, February, 1997

Collision-Resistant Hashing: Towards Making UOWHFs Practical.
IACR Cryptol. ePrint Arch., 1997

A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost.
IACR Cryptol. ePrint Arch., 1997

Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function.
IACR Cryptol. ePrint Arch., 1997

Minimizing the use of random oracles in authenticated encryption schemes.
Proceedings of the Information and Communication Security, First International Conference, 1997

Does Parallel Repetition Lower the Error in Computationally Sound Protocols?
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

A Concrete Security Treatment of Symmetric Encryption.
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

"Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case.
Proceedings of the Advances in Cryptology, 1997

1996
Linearity testing in characteristic two.
IEEE Trans. Inf. Theory, 1996

Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation.
J. Cryptology, 1996

Verifiable Partial Key Escrow.
IACR Cryptol. ePrint Arch., 1996

Distributed Pseudo-Random Bit Generators - A New Way to Speed-Up Shared Coin Tossing.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Pseudorandom Functions Revisited: The Cascade Construction and Its Concrete Security.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin.
Proceedings of the Advances in Cryptology, 1996

Keying Hash Functions for Message Authentication.
Proceedings of the Advances in Cryptology, 1996

1995
The complexity of approximating a nonlinear program.
Math. Program., 1995

Free Bits, PCP and Non-Approximability - Towards Tight Results
Electronic Colloquium on Computational Complexity (ECCC), 1995

iKP - A Family of Secure Electronic Payment Protocols.
Proceedings of the First USENIX Workshop on Electronic Commerce, 1995

Provably secure session key distribution: the three party case.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Incremental cryptography and application to virus protection.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Knowledge on the average-perfect, statistical and logarithmic.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On the Role of Shared Randomness in Two Prover Proof Systems.
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Free Bits, PCPs and Non-Approximability - Towards Tight Results.
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions.
Proceedings of the Advances in Cryptology, 1995

1994
The Complexity of Decision Versus Search.
SIAM J. Comput., 1994

Improved non-approximability results.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Efficient probabilistic checkable proofs and applications to approximation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Randomness-Efficient Oblivious Sampling
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

Optimal Asymmetric Encryption.
Proceedings of the Advances in Cryptology, 1994

The Security of Cipher Block Chaining.
Proceedings of the Advances in Cryptology, 1994

Incremental Cryptography: The Case of Hashing and Signing.
Proceedings of the Advances in Cryptology, 1994

1993
Randomness in Interactive Proofs.
Comput. Complex., 1993

Efficient probabilistically checkable proofs and applications to approximations.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Interactive Proofs and Approximation: Reduction from Two Provers in One Round.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Entity Authentication and Key Distribution.
Proceedings of the Advances in Cryptology, 1993

Random Oracles are Practical: A Paradigm for Designing Efficient Protocols.
Proceedings of the CCS '93, 1993

1992
How to Sign Given Any Trapdoor Permutation.
J. ACM, 1992

Making Zero-Knowledge Provers Efficient
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Certifying Cryptographic Tools: The Case of Trapdoor Permutations.
Proceedings of the Advances in Cryptology, 1992

On Defining Proofs of Knowledge.
Proceedings of the Advances in Cryptology, 1992

A Technique for Upper Bounding the Spectral Norm with Applications to Learning.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
Languages that Are Easier than their Proofs
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
The (True) Complexity of Statistical Zero Knowledge
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Perfect Zero-Knowledge in Constant Rounds
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
On the Structure of Secret Key Exchange Protocols.
Proceedings of the Distributed Computing And Cryptography, 1989

Non-Interactive Oblivious Transfer and Spplications.
Proceedings of the Advances in Cryptology, 1989

New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs.
Proceedings of the Advances in Cryptology, 1989

1988
How to Sign Given Any Trapdoor Function (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

How To Sign Given Any Trapdoor Function.
Proceedings of the Advances in Cryptology, 1988


  Loading...