Yvo G. Desmedt

From MaRDI portal
Revision as of 17:40, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Yvo G. Desmedt to Yvo G. Desmedt: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1304978

Available identifiers

zbMath Open desmedt.yvo-gWikidataQ102291893 ScholiaQ102291893MaRDI QIDQ1304978

List of research outcomes

PublicationDate of PublicationType
VSS Made Simpler2024-03-14Paper
Cryptologists should not ignore the history of Al-Andalusia2023-10-04Paper
Computational aspects of ideal \((t, n)\)-threshold scheme of Chen, Laing, and Martin2023-08-02Paper
Analytical Characteristics of the DES2022-01-08Paper
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification2021-10-06Paper
Access structure hiding secret sharing from novel set systems and vector families2021-04-21Paper
Breaking the traditional computer security research barriers2021-04-07Paper
Economically Optimal Variable Tag Length Message Authentication2021-03-17Paper
Extremal Set Theory and LWE Based Access Structure Hiding Verifiable Secret Sharing with Malicious-Majority and Free Verification2020-11-30Paper
Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption2020-07-20Paper
Evolving Perfect Hash Families: A Combinatorial Viewpoint of Evolving Secret Sharing2020-07-20Paper
Realistic versus Rational Secret Sharing2020-07-20Paper
Perfect Anonymity2019-07-19Paper
Dependence of output on input in DES: Small avalanche characteristics2017-04-10Paper
Private Visual Share-Homomorphic Computation and Randomness Reduction in Visual Cryptography2017-01-06Paper
How to share a function securely2016-09-01Paper
Walsh transforms and cryptographic applications in bias computing2016-05-04Paper
What is the Future of Cryptography?2016-05-02Paper
A subexponential construction of graph coloring for multiparty computation2015-01-22Paper
Efficient Multiplicative Sharing Schemes2014-08-20Paper
Edge-colored graphs with applications to homogeneous faults2013-04-04Paper
Graph coloring applied to secure computation in non-abelian groups2013-01-04Paper
Active Security in Multiparty Computation over Black-Box Groups2012-09-25Paper
Human Perfectly Secure Message Transmission Protocols and Their Applications2012-09-25Paper
A Brief Survey of Research Jointly with Jean-Jacques Quisquater2012-06-08Paper
Secure Communication in Multicast Graphs2011-12-02Paper
Bias Analysis of a Certain Problem with Applications to E0 and Shannon Cipher2011-10-27Paper
Pseudo-Cryptanalysis of Luffa2011-07-29Paper
Redesigning Group Key Exchange Protocol Based on Bilinear Pairing Suitable for Various Environments2011-07-29Paper
Homogeneous Faults, Colored Edge Graphs, and Cover Free Families2011-05-19Paper
Redistribution of Mechanical Secret Shares2011-04-20Paper
Improved Distinguishing Attack on Rabbit2011-02-11Paper
General Perfectly Secure Message Transmission Using Linear Codes2010-12-07Paper
Cryptanalysis of Secure Message Transmission Protocols with Feedback2010-09-29Paper
Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes2010-05-04Paper
Bounds and constructions for key distribution schemes2010-03-10Paper
A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack2010-03-01Paper
Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes2010-02-09Paper
A secure and scalable group key exchange system2009-12-04Paper
Unconditionally Secure Approximate Message Authentication2009-07-23Paper
On Secure Multi-party Computation in Black-Box Groups2009-03-10Paper
Perfectly Secure Message Transmission Revisited2009-02-24Paper
Revisiting Pairing Based Group Key Exchange2009-02-12Paper
A CCA Secure Hybrid Damgård’s ElGamal Encryption2009-01-27Paper
Hybrid Damgård Is CCA1-Secure under the DDH Assumption2009-01-09Paper
Pairing Based Threshold Cryptography Improving on Libert-Quisquater and Baek-Zheng2008-09-09Paper
A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring2008-06-24Paper
A Non-malleable Group Key Exchange Protocol Robust Against Active Insiders2008-06-17Paper
Secure Protocols with Asymmetric Trust2008-05-15Paper
Klein Bottle Routing: An Alternative to Onion Routing and Mix Network2008-05-06Paper
Non-degrading Erasure-Tolerant Information Authentication with an Application to Multicast Stream Authentication over Lossy Channels2008-04-17Paper
Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups2008-03-07Paper
Algorithms and Computation2006-11-14Paper
Information Security2006-10-20Paper
Information Security and Privacy2006-06-22Paper
Index calculation attacks on RSA signature and encryption2006-05-29Paper
https://portal.mardi4nfdi.de/entity/Q33749372006-03-01Paper
Computing and Combinatorics2006-01-11Paper
Selected Areas in Cryptography2005-12-27Paper
ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS2005-10-19Paper
Advanced Encryption Standard – AES2005-09-14Paper
Advances in Cryptology – CRYPTO 20042005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q48086442004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47372672004-08-11Paper
Secure communication in multicast channels: The answer to Franklin and Wright's question2003-12-21Paper
https://portal.mardi4nfdi.de/entity/Q44142892003-07-24Paper
https://portal.mardi4nfdi.de/entity/Q44141992003-07-23Paper
https://portal.mardi4nfdi.de/entity/Q27246012002-05-05Paper
https://portal.mardi4nfdi.de/entity/Q27572392001-11-25Paper
https://portal.mardi4nfdi.de/entity/Q27086212001-07-13Paper
https://portal.mardi4nfdi.de/entity/Q42492832001-03-18Paper
https://portal.mardi4nfdi.de/entity/Q45025042000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45025062000-09-12Paper
https://portal.mardi4nfdi.de/entity/Q45003772000-09-04Paper
Computing Functions of a Shared Secret2000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q43140432000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49500662000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q42507802000-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42492811999-10-06Paper
Divertible and subliminal-free zero-knowledge proofs for languages1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42496341999-09-09Paper
https://portal.mardi4nfdi.de/entity/Q42492851999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42510161999-06-17Paper
A general zero-knowledge scheme1998-12-28Paper
https://portal.mardi4nfdi.de/entity/Q43757241998-07-19Paper
https://portal.mardi4nfdi.de/entity/Q43657471998-01-26Paper
https://portal.mardi4nfdi.de/entity/Q43417761997-10-06Paper
https://portal.mardi4nfdi.de/entity/Q43416671997-08-10Paper
https://portal.mardi4nfdi.de/entity/Q43416691997-08-10Paper
https://portal.mardi4nfdi.de/entity/Q48584541995-12-13Paper
https://portal.mardi4nfdi.de/entity/Q43187231995-04-04Paper
Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group1994-12-20Paper
https://portal.mardi4nfdi.de/entity/Q42796571994-03-10Paper
https://portal.mardi4nfdi.de/entity/Q42795721994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42795731994-03-07Paper
https://portal.mardi4nfdi.de/entity/Q40357391993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40368541993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40368551993-05-18Paper
Broadcast Interactive Proofs1993-05-18Paper
Weaknesses of Undeniable Signature Schemes1993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q32112511990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33582251990-01-01Paper
Remarks on soundness of proofs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38046051988-01-01Paper
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme1985-01-01Paper
Propagation Characteristics of the DES1985-01-01Paper
A critical analysis of the security of knapsack public-key algorithms1984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Yvo G. Desmedt