EP2901613 - INPUT CONSISTENCY VERIFICATION FOR TWO-PARTY SECURE FUNCTION EVALUATION [Right-click to bookmark this link] | Status | The application is deemed to be withdrawn Status updated on 04.06.2021 Database last updated on 30.10.2024 | |
Former | Grant of patent is intended Status updated on 01.09.2020 | ||
Former | Examination is in progress Status updated on 19.10.2018 | Most recent event Tooltip | 04.06.2021 | Application deemed to be withdrawn | published on 07.07.2021 [2021/27] | Applicant(s) | For all designated states Alcatel Lucent Site Nokia Paris Saclay Route de Villejust 91620 Nozay / FR | [2018/16] |
Former [2015/32] | For all designated states ALCATEL LUCENT 148/152 route de la Reine 92100 Boulogne-Billancourt / FR | Inventor(s) | 01 /
KOLESNIKOV, Vladimir, Y. 600-700 Mountain Avenue Murray Hill, NJ 07974-0636 / US | [2015/32] | Representative(s) | Novagraaf Technologies Bâtiment O2 2, rue Sarah Bernhardt CS90017 92665 Asnières-sur-Seine Cedex / FR | [N/P] |
Former [2015/32] | Hirsch & Associés 137, rue de l'Université 75007 Paris / FR | Application number, filing date | 13771683.3 | 18.09.2013 | WO2013US60323 | Priority number, date | US201213630568 | 28.09.2012 Original published format: US201213630568 | [2015/32] | Filing language | EN | Procedural language | EN | Publication | Type: | A1 Application with search report | No.: | WO2014052113 | Date: | 03.04.2014 | Language: | EN | [2014/14] | Type: | A1 Application with search report | No.: | EP2901613 | Date: | 05.08.2015 | Language: | EN | The application published by WIPO in one of the EPO official languages on 03.04.2014 takes the place of the publication of the European patent application. | [2015/32] | Search report(s) | International search report - published on: | EP | 03.04.2014 | Classification | IPC: | H04L9/32 | [2015/32] | CPC: |
H04L9/3218 (EP,US);
H04L2209/46 (EP,US);
H04L2209/50 (EP,US)
| Designated contracting states | AL, AT, BE, BG, CH, CY, CZ, DE, DK, EE, ES, FI, FR, GB, GR, HR, HU, IE, IS, IT, LI, LT, LU, LV, MC, MK, MT, NL, NO, PL, PT, RO, RS, SE, SI, SK, SM, TR [2015/32] | Title | German: | EINGABEKONSISTENZPRÜFUNG FÜR BEURTEILUNG EINER SICHEREN FUNKTION MIT ZWEI PARTEIEN | [2015/32] | English: | INPUT CONSISTENCY VERIFICATION FOR TWO-PARTY SECURE FUNCTION EVALUATION | [2015/32] | French: | VÉRIFICATION DE COHÉRENCE D'ENTRÉE POUR ÉVALUATION DE FONCTION SÉCURISÉE À DEUX PARTIES | [2015/32] | Entry into regional phase | 28.04.2015 | National basic fee paid | 28.04.2015 | Designation fee(s) paid | 28.04.2015 | Examination fee paid | Examination procedure | 28.04.2015 | Examination requested [2015/32] | 23.11.2015 | Amendment by applicant (claims and/or description) | 22.10.2018 | Despatch of a communication from the examining division (Time limit: M06) | 17.04.2019 | Reply to a communication from the examining division | 02.09.2020 | Communication of intention to grant the patent | 13.01.2021 | Application deemed to be withdrawn, date of legal effect [2021/27] | 18.02.2021 | Despatch of communication that the application is deemed to be withdrawn, reason: fee for grant / fee for printing not paid in time [2021/27] | Divisional application(s) | The date of the Examining Division's first communication in respect of the earliest application for which a communication has been issued is 22.10.2018 | Fees paid | Renewal fee | 25.09.2015 | Renewal fee patent year 03 | 22.09.2016 | Renewal fee patent year 04 | 26.09.2017 | Renewal fee patent year 05 | 25.09.2018 | Renewal fee patent year 06 | 13.09.2019 | Renewal fee patent year 07 | 14.09.2020 | Renewal fee patent year 08 |
Opt-out from the exclusive Tooltip competence of the Unified Patent Court | See the Register of the Unified Patent Court for opt-out data | ||
Responsibility for the accuracy, completeness or quality of the data displayed under the link provided lies entirely with the Unified Patent Court. | Cited in | International search | [X] - YEHUDA LINDELL ET AL, "An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries", INTERNATIONAL ASSOCIATION FOR CRYPTOLOGIC RESEARCH,, (20080130), vol. 20080130:161356, pages 1 - 36, XP061002734 [X] 1-10 * abstract * * section 1. Introduction * * section 3.2 Checks for Correctness and Consistency * | [AD] - YEHUDA LINDELL ET AL, "A Proof of Yao's Protocol for Secure Two-Party Computation", INTERNATIONAL ASSOCIATION FOR CRYPTOLOGIC RESEARCH,, (20110111), vol. 20110111:080015, pages 1 - 25, XP061001123 [AD] 1-10 * the whole document * | [AD] - YAO A C-C ED - INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, "HOW TO GENERATE AND EXCHANGE SECRETS", ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. SCIENCE. TORONTO, OCTOBER 27 - 29, 1986; [ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE], WASHINGTON, IEEE COMP. SOC. PRESS, US, (19861027), vol. SYMP. 27, pages 162 - 167, XP000828028 [AD] 1-10 * the whole document * | [AD] - YAO A C, "PROTOCOLS FOR SECURE COMPUTATIONS", ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, XX, XX, (19820101), pages 160 - 164, XP000934053 [AD] 1-10 * the whole document * | [AD] - Yuval Ishai ET AL, "Extending Oblivious Transfers Efficiently", Field Programmable Logic and Application, Berlin, Heidelberg, Springer Berlin Heidelberg, (20030101), vol. 2729, pages 145 - 161, doi:10.1007/978-3-540-45146-4_9, ISSN 0302-9743, ISBN 978-3-54-045234-8, XP055094066 [AD] 1-10 * the whole document * DOI: http://dx.doi.org/10.1007/978-3-540-45146-4_9 | [AD] - DANNY HARNIK ET AL, OT-Combiners via Secure Computation, THEORY OF CRYPTOGRAPHY; [LECTURE NOTES IN COMPUTER SCIENCE], SPRINGER BERLIN HEIDELBERG, BERLIN, HEIDELBERG, PAGE(S) 393 - 411, (20080319), ISBN 978-3-540-78523-1, XP047029750 [AD] 1-10 * the whole document * DOI: http://dx.doi.org/10.1007/978-3-540-78524-8_22 | by applicant | - Y. LINDELL; B. PINKAS, "A Proof of Yao's Protocol for Secure Two-Party Computation", JOURNAL OF CRYPTOLOGY, (2009), vol. 22, no. 2, pages 161 - 188 | - ANDREW C. YAO, "Protocols for Secure Computations", PROC. 23RD IEEE SYMP. ON FOUNDATIONS OF COMP. SCIENCE, (1982), pages 160 - 164, XP031288185 | - ANDREW C. YAO, "How to Generate and Exchange Secrets", PROC. 27TH IEEE SYMP. ON FOUNDATIONS OF COMP. SCIENCE, (1986), pages 162 - 167, XP031288019 | - D. HARNIK ET AL., "OT-Combiners via Secure Computation", TCC 5TH THEORY OF CRYPTOGRAPHY CONFERENCE 2008 (MAR. 2008), LECTURE NOTES IN COMPUTER SCIENCE, (200803), vol. 4948, doi:doi:10.1007/978-3-540-78524-8_22, pages 393 - 411, XP047029750 DOI: http://dx.doi.org/10.1007/978-3-540-78524-8_22 | - Y. ISHAI ET AL., "Extending Oblivious Transfers Efficiently", ADVANCES IN CRYPTOLOGY - CRYPTO 2003 (AUG. 2003), LECTURE NOTES IN COMPUTER SCIENCE, (200308), vol. 2729, doi:doi:10.1007/978-3-540-45146-4_9, pages 145 - 161, XP055094066 DOI: http://dx.doi.org/10.1007/978-3-540-45146-4_9 |