Ueli Maurer

Nicolas Gisin

Oliver von Rotz

Proceedings of the Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, April 28, 2002

Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks.

[BibT_eX]

[DOI]

Serge Fehr

Proceedings of the Advances in Cryptology, 2002

2001

Robustness for Free in Unconditional Multi-Party Computation.

[BibT_eX]

[DOI]

Ueli Maurer

IACR Cryptol. ePrint Arch., 2001

Cryptography 2000±10.

[BibT_eX]

[DOI]

Proceedings of the Informatics - 10 Years Back. 10 Years Ahead., 2001

2000

Authentication theory and hypothesis testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Reasoning about public-key certification: on bindings between entities and public keys.

[BibT_eX]

[DOI]

Reto Kohlas

Ueli Maurer

IEEE J. Sel. Areas Commun., 2000

Player Simulation and General Adversary Structures in Perfect Multiparty Computation.

[BibT_eX]

[DOI]

J. Cryptol., 2000

General Secure Multi-Party Computation from any Linear Secret Sharing Scheme.

[BibT_eX]

[DOI]

Ronald Cramer

Ivan Damgård

Ueli Maurer

IACR Cryptol. ePrint Arch., 2000

The Diffie-Hellman Protocol.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2000

From partial consistency to global broadcast.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Confidence Valuation in a Public-Key Infrastructure Based on Uncertain Evidence.

[BibT_eX]

[DOI]

Reto Kohlas

Proceedings of the Public Key Cryptography, 2000

Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2000

Efficient Secure Multi-party Computation.

[BibT_eX]

[DOI]

Bartosz Przydatek

Proceedings of the Advances in Cryptology, 2000

1999

Unconditionally Secure Key Agreement and the Intrinsic Conditional Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Byzantine Agreement Secure against General Adversaries in the Dual Failure Model.

[BibT_eX]

[DOI]

Bernd Altmann

Proceedings of the Distributed Computing, 1999

Kryptographie: Basistechnologie der Informationsgesellschaft (Zusammenfassung).

[BibT_eX]

[DOI]

Proceedings of the Informatik '99, 1999

Information-Theoretic Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

General Adversaries in Unconditional Multi-party Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1999

1998

Efficient Byzantine Agreement Secure Against General Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

Lower Bounds on Generic Algorithms in Groups.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Trading Correctness for Privacy in Unconditional Multi-Party Computation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1998

1997

Linking Information Reconciliation and Privacy Amplification.

[BibT_eX]

[DOI]

Christian Cachin

J. Cryptol., 1997

Digital Payment Systems With Passive Anonymity-Revoking Trustees.

[BibT_eX]

[DOI]

Jan Camenisch

Markus Stadler

J. Comput. Secur., 1997

Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

Privacy Amplification Secure Against Active Adversaries.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1997

Unconditional Security Against Memory-Bounded Adversaries.

[BibT_eX]

[DOI]

Christian Cachin

Proceedings of the Advances in Cryptology, 1997

1996

A Calculus for Security Bootstrapping in Distributed Systems.

[BibT_eX]

[DOI]

Pierre E. Schmid

J. Comput. Secur., 1996

A Non-interactive Public-Key Distribution System.

[BibT_eX]

[DOI]

Yacov Yacobi

Des. Codes Cryptogr., 1996

A Unified and Generalized Treatment of Authentification Theory.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

Optimal Tree-Based One-Time Digital Signature Schemes.

[BibT_eX]

[DOI]

Daniel Bleichenbacher

Proceedings of the STACS 96, 1996

Modelling a Public-Key Infrastructure.

[BibT_eX]

[DOI]

Proceedings of the Computer Security, 1996

Diffie-Hellman Oracles.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1996

On the Efficiency of One-Time Digital Signatures.

[BibT_eX]

[DOI]

Daniel Bleichenbacher

Proceedings of the Advances in Cryptology, 1996

1995

Generalized privacy amplification.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters.

[BibT_eX]

[DOI]

J. Cryptol., 1995

On the Oracle Complexity of Factoring Integers.

[BibT_eX]

[DOI]

Comput. Complex., 1995

1994

Linking Information Reconciliation and Privacy Amplification (Extended Abstract).

[BibT_eX]

[DOI]

Christian Cachin

Proceedings of the Advances in Cryptology, 1994

A Calculus for Secure Channel Establishment in Open Networks.

[BibT_eX]

[DOI]

Pierre E. Schmid

Proceedings of the Computer Security, 1994

Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1994

Directed Acyclic Graphs, One-way Functions and Digital Signatures.

[BibT_eX]

[DOI]

Daniel Bleichenbacher

Proceedings of the Advances in Cryptology, 1994

1993

Secret key agreement by public discussion from common information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Cascade Ciphers: The Importance of Being First.

[BibT_eX]

[DOI]

J. Cryptol., 1993

1992

A Universal Statistical Test for Random Bit Generators.

[BibT_eX]

[DOI]

J. Cryptol., 1992

Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher.

[BibT_eX]

[DOI]

J. Cryptol., 1992

Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

A Remark on a Non-interactive Public-Key Distribution System.

[BibT_eX]

[DOI]

Yacov Yacobi

Proceedings of the Advances in Cryptology, 1992

Factoring with an Oracle.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

Protocols for Secret Key Agreement by Public Discussion Based on Common Information.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1992

1991

Local Randomness in Pseudorandom Sequences.

[BibT_eX]

[DOI]

J. Cryptol., 1991

Perfect Cryptographic Security from Partially Independent Channels

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Non-interactive Public-Key Cryptography.

[BibT_eX]

[DOI]

Yacov Yacobi

Proceedings of the Advances in Cryptology, 1991

New Approaches to the Design of Self-Synchronizing Stream Ciphers.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

New Public-Key Schemes Based on Elliptic Curves over the Ring Z<sub>n</sub>.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1991

1990

A Provably-Secure Strongly-Randomized Cipher.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1990

Practical Perfect Cryptographic Security.

[BibT_eX]

[DOI]

Proceedings of the Advances In Computational Complexity Theory, 1990

1989

Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

Perfect Local Randomness in Pseudo-Random Sequences.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1989

1987

Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers.

[BibT_eX]

[DOI]