UCL Crypto Group | Moti Yung

Disclaimer: This page refers to an external person. It only lists all the interactions between this person and the Crypto Group. Validity or accuracy of the following information is thus not guaranteed in any way.

Seminars given

November 27, 2002 - Scalable Authenticated Group Key Exchange
by Moti Yung

BibTeX - Yung

Publications

Benoit Libert, Thomas Peters, Marc Joye, and Moti Yung. Linearly Homomorphic Structure-Preserving Signatures and Their Applications, In H. Handschuh & R. Canetti & J. Garay, editor(s), Crypto 2013, Lecture Notes in Computer Science, Spinger, August 2013, To appear BibTeX

Benoit Libert, Thomas Peters, and Moti Yung. Group Signatures with Almost-for-free Revocation, In R. Safavi-Naini & R. Canetti, editor(s), Crypto 2012, Volume 7417 of Lecture Notes in Computer Science, pages 571-589, Springer, August 2012 BibTeX

Benoit Libert, Thomas Peters, and Moti Yung. Scalable Group Signatures with Revocation, In D. Pointcheval & T. Johansson, editor(s), Eurocrypt 2012, Volume 7237 of Lecture Notes in Computer Science, pages 609-627, Springer, April 2012 BibTeX

Benoit Libert, and Moti Yung. Non-Interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions, In R. Cramer, editor(s), 9th Theory of Cryptography Conference (TCC 2012), Volume 7194 of Lecture Notes in Computer Science, pages 75-93, Springer, March 2012, BibTeX

Benoit Libert, and Moti Yung. Adaptively Secure Non-Interactive Threshold Cryptosystems, In J. Sgall, L. Aceto & M. Henzinger, editor(s), 38th International Colloquium on Automata, Languages and Programming (ICALP 2011) - Track C, Volume 6756 of Lecture Notes in Computer Science (LNCS), pages 588-600, Springer, July 2011, BibTeX

Benoit Libert, and Moti Yung. Efficient Traceable Signatures in the Standard Model, In Theoretical Computer Science, Volume 412-12-14, pages 1220-1242, March 2011 BibTeX

Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Key Evolution Systems in Untrusted Update Environments, In ACM Transactions on Information and System Security (TISSEC), Volume 13-4, December 2010 BibTeX

François-Xavier Standaert, Olivier Pereira, Yu Yu, Jean-Jacques Quisquater, Moti Yung, and Elisabeth Oswald. Leakage Resilient Cryptography in Practice, In Towards Hardware Intrinsic Security: Foundation and Practice, pages 105-139, Springer, November 2010 BibTeX

Yu Yu, François-Xavier Standaert, Olivier Pereira, and Moti Yung. Practical leakage-resilient pseudorandom generators, Proceedings of the 17th ACM conference on Computer and communications security, pages 141--151 , ACM, October 2010 PDF BibTeX

Benoit Libert, and Moti Yung. Efficient Completely Non-Malleable Public Key Encryption, In P. Spirakis, S. Abramsky & F. Meyer auf der Heide, editor(s), 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) - Track A, Volume 6198 of Lecture Notes in Computer Science (LNCS), pages 127-139, Springer, July 2010, To appear BibTeX

Benoit Libert, and Moti Yung. Dynamic Fully Foward-Secure Group Signatures, In D. Basin and P. Liu, editor(s), 5th ACM Symposium on Information, Computer and Communications Security (AsiaCCS 2010), ACM Press, April 2010, to appear BibTeX

Benoit Libert, and Moti Yung. Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, In D. Micciancio, editor(s), Theory of Cryptography Conference 2010 (TCC'10), Volume 5978 of Lecture Notes in Computer Science (LNCS), pages 499-517, Spinger, February 2010, BibTeX

Julien Cathalo, Benoit Libert, and Moti Yung. Group Encryption: Non-Interactive Realization in the Standard Model, In M. Matsui, editor(s), Asiacrypt 2009, Volume 5912 of Lecture Notes in Computer Science, pages 179-196, Springer, December 2009 BibTeX

Benoit Libert, and Moti Yung. Efficient Traceable Signatures in the Standard Model, In H. Shacham and B. Waters, editor(s), 3rd International Conference on Pairing-Based Cryptography (Pairing 2009), Volume 5671 of Lecture Notes in Computer Science, pages 187-205, Springer, August 2009 BibTeX

Christophe Petit, François-Xavier Standaert, Olivier Pereira, Tal G. Malkin, and Moti Yung. A Block Cipher based Pseudo Random Number Generator Secure Against Side-Channel Key Recovery, In M. Abe and V. Gligor, editor(s), ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications security, pages 56--65, ACM, March 2008 PDF BibTeX

Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Forward-Secure Signatures in Untrusted Update Environments: Efficient and Generic Constructions, In S. De Capitani di Vimercati and P. Syverson, editor(s), 14th ACM Conference on Computer and Communications Security (ACM CCS'07), pages 266-275, ACM, October 2007 BibTeX

Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Parallel Key-Insulated Public Key Encryption Without Random Oracles, In T. Okamoto and X. Wang, editor(s), Public Key Cryptography 2007 (PKC'07), Volume 4450 of Lecture Notes in Computer Science, pages 298-314, Springer, April 2007 BibTeX

Benoit Libert, Jean-Jacques Quisquater, and Moti Yung. Efficient Intrusion-Resilient Signatures Without Random Oracles, In H. Lipmaa and M. Yung, editor(s), Inscrypt 2006, Volume 4318 of Lecture Notes in Computer Science, pages 27-41, Springer, December 2006 BibTeX

Tal G. Malkin, François-Xavier Standaert, and Moti Yung. A Comparative Cost/Security Analysis of Fault Attack Countermeasures, FDTC 2005/2006, Volume 4236 of Lecture Notes in Computer Science, pages 159-172, September 2005 BibTeX

Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, and Moti Yung. Observability Analysis: Detecting when Improved Cryptosystems Fail, RSA Conference 2002, San Jose, USA, Volume 2271 of Lecture Notes in Computer Science, pages 17-29, Springer-Verlag, February 2002 PDF BibTeX

Marc Joye, Jean-Jacques Quisquater, and Moti Yung. On the power of misbehaving adversaries and security analysis of the original EPOC, Topics in Cryptology - CT-RSA 2001, Volume 2020 of Lecture Notes in Computer Science, pages 208-222, Springer-Verlag, April 2001 PDF BibTeX

Markus Jakobsson, Moti Yung, and Julien Stern. Scramble all, encrypt small, Proceedings of Fast Software Encryption: 6th International Workshop - FSE ’99, Volume 1636 of Lecture Notes in Computer Science (LNCS), pages 95-111, Springer-Verlag, January 1999 PDF BibTeX

Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, and Moti Yung. Security paradoxes: How improving a cryptosystem may weaken it, Ninth National Conference on Information Security, Taichung, Taiwan, pages 27-32, January 1999 BibTeX

Copyright Notice

(click here to expand/retract)

Some material that is available from this page is copyrighted.

IACR Copyright Notice: Permission is granted for a user to display all material at this site, to copy the material onto a single computer, and to make print copies of the material for personal use only. All other rights are retained by the International Association for Cryptologic Research. In particular, any other copying, other redistribution, or any commercial use of the material requires the permission of the publisher, which may be requested by contacting the International Association for Cryptologic Research.

IEEE Copyright Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

ACM Copyright Notice: Copyright © 1999 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page or intial screen of the document. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM Inc., fax +1 (212) 869-0481, or permissions@acm.org.

Springer-Verlag LNCS Copyright Notice: The copyright of these contributions has been transferred to Springer-Verlag Berlin Heidelberg New York. The copyright transfer covers the exclusive right to reproduce and distribute the contribution, including reprints, translations, photographic reproductions, microform, electronic form (offline, online), or any other reproductions of similar nature. Online available from Springer-Verlag LNCS series.