Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
We define a call-by-value variant of Gödel’s system T with references, and equip it with a linear dependent type and effect system, called d ℓ T , that can estimate the time complexity of programs, as a function of the size of their inputs. We prove that the type system is intentionally sound, in th...
Uložené v:
| Vydané v: | Journal of automated reasoning Ročník 63; číslo 4; s. 813 - 855 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Dordrecht
Springer Netherlands
01.12.2019
Springer Nature B.V |
| Predmet: | |
| ISSN: | 0168-7433, 1573-0670 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We define a call-by-value variant of Gödel’s system
T
with references, and equip it with a linear dependent type and effect system, called
d
ℓ
T
, that can estimate the time complexity of programs, as a function of the size of their inputs. We prove that the type system is intentionally sound, in the sense that it over-approximates the complexity of executing the programs on a variant of the CEK abstract machine. Moreover, we define a sound and complete type inference algorithm which critically exploits the subrecursive nature of
d
ℓ
T
. Finally, we demonstrate the usefulness of
d
ℓ
T
for analyzing the complexity of cryptographic reductions by providing an upper bound for the constructed adversary of the Goldreich–Levin theorem. |
|---|---|
| AbstractList | We define a call-by-value variant of Gödel’s system \[\textsf {T} \] with references, and equip it with a linear dependent type and effect system, called \[\textsf {d}\ell \textsf {T} \], that can estimate the time complexity of programs, as a function of the size of their inputs. We prove that the type system is intentionally sound, in the sense that it over-approximates the complexity of executing the programs on a variant of the CEK abstract machine. Moreover, we define a sound and complete type inference algorithm which critically exploits the subrecursive nature of \[\textsf {d}\ell \textsf {T} \]. Finally, we demonstrate the usefulness of \[\textsf {d}\ell \textsf {T} \] for analyzing the complexity of cryptographic reductions by providing an upper bound for the constructed adversary of the Goldreich–Levin theorem. We define a call-by-value variant of Gödel’s system T with references, and equip it with a linear dependent type and effect system, called d ℓ T , that can estimate the time complexity of programs, as a function of the size of their inputs. We prove that the type system is intentionally sound, in the sense that it over-approximates the complexity of executing the programs on a variant of the CEK abstract machine. Moreover, we define a sound and complete type inference algorithm which critically exploits the subrecursive nature of d ℓ T . Finally, we demonstrate the usefulness of d ℓ T for analyzing the complexity of cryptographic reductions by providing an upper bound for the constructed adversary of the Goldreich–Levin theorem. |
| Author | Barthe, Gilles Dal Lago, Ugo Baillot, Patrick |
| Author_xml | – sequence: 1 givenname: Patrick surname: Baillot fullname: Baillot, Patrick organization: Univ Lyon, CNRS, EnsL, UCBL, LIP – sequence: 2 givenname: Gilles surname: Barthe fullname: Barthe, Gilles organization: IMDEA Software Institute – sequence: 3 givenname: Ugo orcidid: 0000-0001-9200-070X surname: Dal Lago fullname: Dal Lago, Ugo email: dallago@cs.unibo.it organization: Università di Bologna, INRIA |
| BookMark | eNp9kF1LwzAUhoNMcE7_gFcFr6snTZs0l6N-DQYK6nVIs2RmdE1NUnH_3m4VBC92FU54n_PxnKNJ61qN0BWGGwzAbgOGErMUME-BFwTS7ARNccFICpTBBE0B0zJlOSFn6DyEDQAQDHyKzGLbNVbZmFRu2_VRRuta2RyqRn_buEucSV772mvV-2C_dHKnjW3tPhcS2a6SebfvIMeP6JLK77ro1l52H1YlL945Ey7QqZFN0Je_7wy9P9y_VU_p8vlxUc2XqSKUxJTURa3BMFUUkjFMlJFaQsE5JSRnXJuVZhktTYGVAgol0XWeUb6SjJaKGE1m6Hrs23n32esQxcb1fjgoiCyjLGOc53RIZWNKeReC10Z03m6l3wkMYu9TjD7F4FMcfIpsgMp_0GDtcHX00jbHUTKiYZjTrrX_2-oI9QNc144t |
| CitedBy_id | crossref_primary_10_1017_S0956796823000023 |
| Cites_doi | 10.1007/978-3-540-92188-2_5 10.2168/LMCS-8(4:11)2012 10.1007/978-3-540-70936-7_10 10.2168/LMCS-12(1:4)2016 10.1145/2480359.2429090 10.1145/1594834.1480898 10.1145/168588.168596 10.1145/1555746.1555752 10.1145/2034574.2034811 10.1145/1462179.1462180 10.1007/978-3-642-22792-9_5 10.1023/A:1019916231463 10.3233/FI-1993-191-207 10.1007/978-3-662-48899-7_15 10.1145/1866307.1866350 10.1007/978-3-642-11957-6_16 10.1109/SP.2006.1 10.1201/9781420010756 10.1145/1594834.1480894 10.1145/507635.507666 10.1016/j.ic.2008.08.005 10.1145/2578855.2535847 10.1145/2775051.2677000 10.1145/1328897.1328457 10.1016/S0168-0072(00)00010-5 |
| ContentType | Journal Article |
| Copyright | Springer Nature B.V. 2019 Journal of Automated Reasoning is a copyright of Springer, (2019). All Rights Reserved. |
| Copyright_xml | – notice: Springer Nature B.V. 2019 – notice: Journal of Automated Reasoning is a copyright of Springer, (2019). All Rights Reserved. |
| DBID | AAYXX CITATION 7SC 8FD 8FE 8FG ABJCF AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L6V L7M L~C L~D M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS |
| DOI | 10.1007/s10817-019-09530-2 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Materials Science & Engineering ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection (ProQuest) |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Computer Science Database |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1573-0670 |
| EndPage | 855 |
| ExternalDocumentID | 10_1007_s10817_019_09530_2 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 2.D 203 28- 29J 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 6TJ 78A 8FE 8FG 8TC 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACNCT ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BSONS CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV KOW L6V LAK LLZTM M4Y M7S MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P62 P9O PF0 PT4 PT5 PTHSS QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VXZ W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 8FD AZQEC DWQXO GNUQQ JQ2 L7M L~C L~D PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c363t-3b5be0f7c55a7713cfaea0599633479efde7268f51cc06083eb4269da768c3fe3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000488929300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0168-7433 |
| IngestDate | Tue Nov 04 22:20:25 EST 2025 Tue Nov 18 22:39:59 EST 2025 Sat Nov 29 05:55:13 EST 2025 Fri Feb 21 02:34:13 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Complexity analysis Cryptographic proofs Linear dependent types Implicit computational complexity |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-3b5be0f7c55a7713cfaea0599633479efde7268f51cc06083eb4269da768c3fe3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0001-9200-070X |
| OpenAccessLink | https://hal.archives-ouvertes.fr/hal-02399471 |
| PQID | 2267279946 |
| PQPubID | 2028908 |
| PageCount | 43 |
| ParticipantIDs | proquest_journals_2267279946 crossref_primary_10_1007_s10817_019_09530_2 crossref_citationtrail_10_1007_s10817_019_09530_2 springer_journals_10_1007_s10817_019_09530_2 |
| PublicationCentury | 2000 |
| PublicationDate | 20191200 2019-12-00 20191201 |
| PublicationDateYYYYMMDD | 2019-12-01 |
| PublicationDate_xml | – month: 12 year: 2019 text: 20191200 |
| PublicationDecade | 2010 |
| PublicationPlace | Dordrecht |
| PublicationPlace_xml | – name: Dordrecht |
| PublicationTitle | Journal of automated reasoning |
| PublicationTitleAbbrev | J Autom Reasoning |
| PublicationYear | 2019 |
| Publisher | Springer Netherlands Springer Nature B.V |
| Publisher_xml | – name: Springer Netherlands – name: Springer Nature B.V |
| References | XiHDependent types for program termination verificationHigher-Order Symb. Comput.200215191131188585310.1023/A:1019916231463 HofmannMSafe recursion with higher types and BCK-algebraAnn. Pure Appl. Log.20001041–3113166177893710.1016/S0168-0072(00)00010-5 Dal LagoUThe geometry of linear higher-order recursionACM Trans. Comput. Log.20091028:18:38252190610.1145/1462179.1462180 Halevi, S.: A plausible approach to computer-aided cryptographic proofs. IACR Cryptology ePrint Archive, p. 181 (2005) Accattoli, B., Dal Lago, U.: (Leftmost-outermost) beta reduction is invariant, indeed. Log. Methods Comput. Sci. 12(1) (2016) BartheGillesGrégoireBenjaminZanella BéguelinSantiagoFormal certification of code-based cryptographic proofsACM SIGPLAN Notices20094419010.1145/1594834.1480894 PetcherAdamMorrisettGregThe Foundational Cryptography FrameworkLecture Notes in Computer Science2015Berlin, HeidelbergSpringer Berlin Heidelberg5372 BaillotPTeruiKLight types for polynomial time computation in lambda calculusInf. Comput.200920714162248798810.1016/j.ic.2008.08.005 BartheGillesGrégoireBenjaminHeraudSylvainBéguelinSantiago ZanellaComputer-Aided Security Proofs for the Working CryptographerAdvances in Cryptology – CRYPTO 20112011Berlin, HeidelbergSpringer Berlin Heidelberg719010.1007/978-3-642-22792-9_5 LeivantDMarionJ-YLambda calculus characterizations of poly-timeFundam. Inform.1993191/216718412703500781.68059 JonesNDKristiansenLA flow calculus of mwp-bounds for complexity analysisACM Trans. Comput. Log.200910428256196810.1145/1555746.1555752 Dal Lago, U., Gaboardi, M.: Linear dependent types and relative completeness. Log. Methods Comput. Sci. 8(4) (2011) Swamy, N., Chen, J., Fournet, C., Strub, P.-Y., Bhargavan, K., Yang, J.: Secure distributed programming with value-dependent types. In: Proceedings of ICFP 2011, pp. 266–278 (2011) GulwaniSumitMehraKrishna K.ChilimbiTrishulSPEEDACM SIGPLAN Notices200944112710.1145/1594834.1480898 Dal lagoUgoPetitBarbaraThe geometry of typesACM SIGPLAN Notices201348116717810.1145/2480359.2429090 Goldreich, O.: On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits. In: Theory of Cryptography, pp. 174–193. Springer, Berlin (2007) Grobauer, B.: Cost recurrences for DML programs. In: International Conference on Functional Programming (ICFP ’01), pp. 253–264 (2001) BartheGillesGaboardiMarcoGallego AriasEmilio JesúsHsuJustinRothAaronStrubPierre-YvesHigher-Order Approximate Relational Refinement Types for Mechanism Design and Differential PrivacyACM SIGPLAN Notices2015501556810.1145/2775051.2677000 Lesourd, M.: Type inference for complexity analysis of functional programs (2016). Master Thesis, ENS Lyon. https://ilsordo.github.io/research/rapport2016.pdf DanielssonNils AndersLightweight semiformal time complexity analysis for purely functional data structuresACM SIGPLAN Notices2008431133239847110.1145/1328897.1328457 HoffmannJanHofmannMartinAmortized Resource Analysis with Polynomial PotentialProgramming Languages and Systems2010Berlin, HeidelbergSpringer Berlin Heidelberg28730610.1007/978-3-642-11957-6_16 BaillotPatrickBartheGillesLagoUgo DalImplicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic ProofsLogic for Programming, Artificial Intelligence, and Reasoning2015Berlin, HeidelbergSpringer Berlin Heidelberg20321810.1007/978-3-662-48899-7_15 Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: design and implementation of a cost and termination analyzer for Java bytecode. In: Formal Methods for Components and Objects, 6th International Symposium, FMCO 2007, pp. 113–132 (2007) Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the lambda-calculus. In: 3rd Working Conference on the Formal Description of Programming Concepts (1986) Barthe, G., Fournet, C., Grégoire, B., Strub, P.-Y., Swamy, N., Zanella-Béguelin, S.: Probabilistic relational verification for cryptographic implementations. In: Proceedings of POPL 2014, pp. 193–206 (2014) Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of Computer and Communications Security, pp. 62–73 (1993) KatzJLindellYIntroduction to Modern Cryptography2007LondonChapman & Hall10.1201/9781420010756 Blanchet, B.: A computationally sound mechanized prover for security protocols. In: IEEE Symposium on Security and Privacy, pp. 140–154 (2006) Barthe, G., Daubignard, M., Kapron, B., Lakhnech, Y.: Computational indistinguishability logic. In: Proceedings of Computer and Communications Security, CCS 2010, pp. 375–386. ACM, New York (2010) 9530_CR28 9530_CR26 9530_CR6 9530_CR5 Gilles Barthe (9530_CR7) 2015; 50 9530_CR20 J Katz (9530_CR24) 2007 U Dal Lago (9530_CR12) 2009; 10 Patrick Baillot (9530_CR3) 2015 Nils Anders Danielsson (9530_CR15) 2008; 43 Gilles Barthe (9530_CR9) 2011 D Leivant (9530_CR25) 1993; 19 Jan Hoffmann (9530_CR21) 2010 Ugo Dal lago (9530_CR14) 2013; 48 H Xi (9530_CR29) 2002; 15 9530_CR17 9530_CR16 Gilles Barthe (9530_CR8) 2009; 44 Adam Petcher (9530_CR27) 2015 9530_CR18 P Baillot (9530_CR4) 2009; 207 9530_CR13 9530_CR11 9530_CR10 9530_CR2 9530_CR1 Sumit Gulwani (9530_CR19) 2009; 44 ND Jones (9530_CR23) 2009; 10 M Hofmann (9530_CR22) 2000; 104 |
| References_xml | – reference: GulwaniSumitMehraKrishna K.ChilimbiTrishulSPEEDACM SIGPLAN Notices200944112710.1145/1594834.1480898 – reference: HoffmannJanHofmannMartinAmortized Resource Analysis with Polynomial PotentialProgramming Languages and Systems2010Berlin, HeidelbergSpringer Berlin Heidelberg28730610.1007/978-3-642-11957-6_16 – reference: Dal LagoUThe geometry of linear higher-order recursionACM Trans. Comput. Log.20091028:18:38252190610.1145/1462179.1462180 – reference: DanielssonNils AndersLightweight semiformal time complexity analysis for purely functional data structuresACM SIGPLAN Notices2008431133239847110.1145/1328897.1328457 – reference: Barthe, G., Fournet, C., Grégoire, B., Strub, P.-Y., Swamy, N., Zanella-Béguelin, S.: Probabilistic relational verification for cryptographic implementations. In: Proceedings of POPL 2014, pp. 193–206 (2014) – reference: Lesourd, M.: Type inference for complexity analysis of functional programs (2016). Master Thesis, ENS Lyon. https://ilsordo.github.io/research/rapport2016.pdf – reference: Dal lagoUgoPetitBarbaraThe geometry of typesACM SIGPLAN Notices201348116717810.1145/2480359.2429090 – reference: BartheGillesGrégoireBenjaminZanella BéguelinSantiagoFormal certification of code-based cryptographic proofsACM SIGPLAN Notices20094419010.1145/1594834.1480894 – reference: Accattoli, B., Dal Lago, U.: (Leftmost-outermost) beta reduction is invariant, indeed. Log. Methods Comput. Sci. 12(1) (2016) – reference: Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: COSTA: design and implementation of a cost and termination analyzer for Java bytecode. In: Formal Methods for Components and Objects, 6th International Symposium, FMCO 2007, pp. 113–132 (2007) – reference: BaillotPTeruiKLight types for polynomial time computation in lambda calculusInf. Comput.200920714162248798810.1016/j.ic.2008.08.005 – reference: BartheGillesGrégoireBenjaminHeraudSylvainBéguelinSantiago ZanellaComputer-Aided Security Proofs for the Working CryptographerAdvances in Cryptology – CRYPTO 20112011Berlin, HeidelbergSpringer Berlin Heidelberg719010.1007/978-3-642-22792-9_5 – reference: LeivantDMarionJ-YLambda calculus characterizations of poly-timeFundam. Inform.1993191/216718412703500781.68059 – reference: Halevi, S.: A plausible approach to computer-aided cryptographic proofs. IACR Cryptology ePrint Archive, p. 181 (2005) – reference: JonesNDKristiansenLA flow calculus of mwp-bounds for complexity analysisACM Trans. Comput. Log.200910428256196810.1145/1555746.1555752 – reference: Blanchet, B.: A computationally sound mechanized prover for security protocols. In: IEEE Symposium on Security and Privacy, pp. 140–154 (2006) – reference: PetcherAdamMorrisettGregThe Foundational Cryptography FrameworkLecture Notes in Computer Science2015Berlin, HeidelbergSpringer Berlin Heidelberg5372 – reference: BaillotPatrickBartheGillesLagoUgo DalImplicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic ProofsLogic for Programming, Artificial Intelligence, and Reasoning2015Berlin, HeidelbergSpringer Berlin Heidelberg20321810.1007/978-3-662-48899-7_15 – reference: Barthe, G., Daubignard, M., Kapron, B., Lakhnech, Y.: Computational indistinguishability logic. In: Proceedings of Computer and Communications Security, CCS 2010, pp. 375–386. ACM, New York (2010) – reference: Swamy, N., Chen, J., Fournet, C., Strub, P.-Y., Bhargavan, K., Yang, J.: Secure distributed programming with value-dependent types. In: Proceedings of ICFP 2011, pp. 266–278 (2011) – reference: BartheGillesGaboardiMarcoGallego AriasEmilio JesúsHsuJustinRothAaronStrubPierre-YvesHigher-Order Approximate Relational Refinement Types for Mechanism Design and Differential PrivacyACM SIGPLAN Notices2015501556810.1145/2775051.2677000 – reference: KatzJLindellYIntroduction to Modern Cryptography2007LondonChapman & Hall10.1201/9781420010756 – reference: Grobauer, B.: Cost recurrences for DML programs. In: International Conference on Functional Programming (ICFP ’01), pp. 253–264 (2001) – reference: Felleisen, M., Friedman, D.P.: Control operators, the SECD-machine, and the lambda-calculus. In: 3rd Working Conference on the Formal Description of Programming Concepts (1986) – reference: HofmannMSafe recursion with higher types and BCK-algebraAnn. Pure Appl. Log.20001041–3113166177893710.1016/S0168-0072(00)00010-5 – reference: XiHDependent types for program termination verificationHigher-Order Symb. Comput.200215191131188585310.1023/A:1019916231463 – reference: Goldreich, O.: On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits. In: Theory of Cryptography, pp. 174–193. Springer, Berlin (2007) – reference: Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of Computer and Communications Security, pp. 62–73 (1993) – reference: Dal Lago, U., Gaboardi, M.: Linear dependent types and relative completeness. Log. Methods Comput. Sci. 8(4) (2011) – ident: 9530_CR2 doi: 10.1007/978-3-540-92188-2_5 – ident: 9530_CR13 doi: 10.2168/LMCS-8(4:11)2012 – ident: 9530_CR17 doi: 10.1007/978-3-540-70936-7_10 – ident: 9530_CR1 doi: 10.2168/LMCS-12(1:4)2016 – volume: 48 start-page: 167 issue: 1 year: 2013 ident: 9530_CR14 publication-title: ACM SIGPLAN Notices doi: 10.1145/2480359.2429090 – volume: 44 start-page: 127 issue: 1 year: 2009 ident: 9530_CR19 publication-title: ACM SIGPLAN Notices doi: 10.1145/1594834.1480898 – ident: 9530_CR10 doi: 10.1145/168588.168596 – volume: 10 start-page: 28 issue: 4 year: 2009 ident: 9530_CR23 publication-title: ACM Trans. Comput. Log. doi: 10.1145/1555746.1555752 – ident: 9530_CR28 doi: 10.1145/2034574.2034811 – volume: 10 start-page: 8:1 issue: 2 year: 2009 ident: 9530_CR12 publication-title: ACM Trans. Comput. Log. doi: 10.1145/1462179.1462180 – ident: 9530_CR20 – start-page: 71 volume-title: Advances in Cryptology – CRYPTO 2011 year: 2011 ident: 9530_CR9 doi: 10.1007/978-3-642-22792-9_5 – volume: 15 start-page: 91 issue: 1 year: 2002 ident: 9530_CR29 publication-title: Higher-Order Symb. Comput. doi: 10.1023/A:1019916231463 – volume: 19 start-page: 167 issue: 1/2 year: 1993 ident: 9530_CR25 publication-title: Fundam. Inform. doi: 10.3233/FI-1993-191-207 – start-page: 203 volume-title: Logic for Programming, Artificial Intelligence, and Reasoning year: 2015 ident: 9530_CR3 doi: 10.1007/978-3-662-48899-7_15 – ident: 9530_CR5 doi: 10.1145/1866307.1866350 – start-page: 287 volume-title: Programming Languages and Systems year: 2010 ident: 9530_CR21 doi: 10.1007/978-3-642-11957-6_16 – ident: 9530_CR11 doi: 10.1109/SP.2006.1 – volume-title: Introduction to Modern Cryptography year: 2007 ident: 9530_CR24 doi: 10.1201/9781420010756 – ident: 9530_CR26 – volume: 44 start-page: 90 issue: 1 year: 2009 ident: 9530_CR8 publication-title: ACM SIGPLAN Notices doi: 10.1145/1594834.1480894 – ident: 9530_CR18 doi: 10.1145/507635.507666 – start-page: 53 volume-title: Lecture Notes in Computer Science year: 2015 ident: 9530_CR27 – ident: 9530_CR16 – volume: 207 start-page: 41 issue: 1 year: 2009 ident: 9530_CR4 publication-title: Inf. Comput. doi: 10.1016/j.ic.2008.08.005 – ident: 9530_CR6 doi: 10.1145/2578855.2535847 – volume: 50 start-page: 55 issue: 1 year: 2015 ident: 9530_CR7 publication-title: ACM SIGPLAN Notices doi: 10.1145/2775051.2677000 – volume: 43 start-page: 133 issue: 1 year: 2008 ident: 9530_CR15 publication-title: ACM SIGPLAN Notices doi: 10.1145/1328897.1328457 – volume: 104 start-page: 113 issue: 1–3 year: 2000 ident: 9530_CR22 publication-title: Ann. Pure Appl. Log. doi: 10.1016/S0168-0072(00)00010-5 |
| SSID | ssj0003109 |
| Score | 2.2041554 |
| Snippet | We define a call-by-value variant of Gödel’s system
T
with references, and equip it with a linear dependent type and effect system, called
d
ℓ
T
, that can... We define a call-by-value variant of Gödel’s system \[\textsf {T} \] with references, and equip it with a linear dependent type and effect system, called... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 813 |
| SubjectTerms | Abstract machines Algorithms Artificial Intelligence Complexity Computer Science Cryptography Mathematical Logic and Formal Languages Mathematical Logic and Foundations Sound Symbolic and Algebraic Manipulation Upper bounds |
| SummonAdditionalLinks | – databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFA46PXhx_sTplBy8abBt2mY9yZgORRg7KOxW2vyAgrSzrcL-e_PS1KrgLh5L2lB4L-99Sb73PYQuXUdBVgkAuSniMyFIBMwclYagb6eU7wjTbILNZqPFIprbA7fK0irbmGgCtSg4nJHfaJigU20U-eHt8o1A1yi4XbUtNDbRlut5Lvj5EyNfkRhULxttb9DMpNQWzdjSuZELpEsgDAXUId7PxNShzV8XpCbvTPv__eM9tGsRJx43LrKPNmR-gPptNwdsF_chUo-GXJ7VuBmzp4TmCVQz6xUuFNaBpoQjemC94zupsrzhfOEkF3j87TYc1wWelKtl3WhiZxzPNUhX1RF6md4_Tx6I7cJAOA1pTWgapNJRjAdBwvSWlqtEJkbVhUIVqlRCMi8cqcDl3Ak1opMplMeKRG9kOFWSHqNeXuTyBGHmONxRGgEK_U6qwYkGN8KnSSp93484GyC3NUHMrUQ5dMp4jTtxZTBbrM0WG7PF3gBdfX2zbAQ61r49bG0V28VaxZ2hBui6tXY3_Pdsp-tnO0M7HjiYIb8MUa8u3-U52uYfdVaVF8ZVPwH7BO6z priority: 102 providerName: ProQuest |
| Title | Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs |
| URI | https://link.springer.com/article/10.1007/s10817-019-09530-2 https://www.proquest.com/docview/2267279946 |
| Volume | 63 |
| WOSCitedRecordID | wos000488929300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1573-0670 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003109 issn: 0168-7433 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3PS8MwFH7o5sGL8ydOZ8nBmxbapT-Pc24owiibyvBS2jSBgXSjrcL-e_PSdpuigl4KJWkoL8l7X5LvfQG4NA2BUcVG5CZ0y00S3Udmjogd1LcTwjISddmEOxp506kfVElhec12r48klafeSHbzTKRJIsXHpoYuHW9ThjsPp-N48rzyv6h1WSp6o1ImpVWqzPdtfA5Ha4z55VhURZth63__uQ97FbokvXI4HMAWTw-hVd_cQKqJfATiXhHJZwUpy6odQfWGCpnFkswFkU4lw-14ZLiTWy5macnvIlGakN7GyTcp5qSfLRdFqX89YySQgFzkx_A0HDz27_TqxgWdUYcWOo3tmBvCZbYduXL5ykTEI6XgQjHjlIuEu13HE7bJmOFI9MZjTIVNIrloYVRwegKNdJ7yUyCuYTBDSLSXyDqxBCISyCQWjWJuWZbP3DaYteFDVsmR460Yr-FaSBkNGUpDhsqQYbcNV6tvFqUYx6-1O3V_htXEzEOJNiVi833LacN13X_r4p9bO_tb9XPY7eIQUMSXDjSK7I1fwA57L2Z5pkHzZjAKxhpsP7i6hnzTiXwG9oumhvIHePrpPw |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFfRifWK16h70pME0m2Sbg0jxQUtr8aDQW0z2AQVJaxuV_il_ozubxKpgbx48ht0sJPvt7Lc7M98AHNVthbuKh8xNWS4TwgowMkfFPurbKeXawhSbYL1eo98P7krwXuTCYFhlYRONoRZDjnfkZ5om6K02CFz_YvRsYdUo9K4WJTQyWHTk9E0f2Sbn7Ss9v8eOc3N9f9my8qoCFqc-TS0ae7G0FeOeFzF9ROMqkpFRKaGYVSmVkMzxG8qrc277mqHIGNM9RaSJOadKUj3uAiy6tMFQq7_DrE_LjyqbmZY4anRSmifp5Kl6jToGeWKAkkdty_m-Ec7Y7Q-HrNnnbir_7Q-twWrOqEkzWwLrUJLJBlSKahUkN16boNomeH6QkqwtvwU1T6gKmk7JUBFtSMfogsCofnIl1SDJYtpIlAjS_OLtJ-mQXI6nozTT_B5wcqcPIWqyBQ9_8rXbUE6GidwBwmyb20ozXKH7xJp8afImXBrF0nXdgLMq1IspD3kuwY6VQJ7CmXg0wiTUMAkNTEKnCief74wyAZK5vWsFNsLcGE3CGTCqcFqga9b8-2i780c7hOXW_W037LZ7nT1YcRDcJtCnBuV0_CL3YYm_poPJ-MAsEwKPf426D4KuTDs |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9NAEB2FFCEupHyJQAp7gBO14nj9ER9QFSVEREFRDiDl5tr7IUVCTrANKH-NX8fMep2USs0thx4t2yvZfjvz1vvmDcD7gaspqwTE3LTjR1I6MSlzdBaSv53WvitNs4losRiuVvGyBX-bWhiSVTYx0QRquRH0j7yPNAFTbRz7YV9bWcRyMr3a_nSogxTttDbtNGqIzNXuDy7fyk-zCX7rD543_fxt_MWxHQYcwUNeOTwLMuXqSARBGuFyTehUpcaxhFOFpdJSRV441MFACDdEtqIyKv2UKZJ0wbXiOO4DOMMsHNAcm0fOPguQ42btK05-nZzbgh1btjcckOCTxEoBdx3v_6R4YLq3NmdNzpt27vPbOocnlmmzUT01nkJL5c-g03SxYDaoPQc9M6L6dcXqc_bvqDkit9BqxzaaYYAtaGuC1P5sovQ6r7VuLM0lG91QAbBqw8bFblvVXuBrwZa4ONHlC_h-kqd9Ce18k6tXwCLXFa5G5ivxmgxJGZI66fM0U77vxyLqwqD5_Imw1uzUIeRHcjCVJsgkCJnEQCbxuvBxf8-2NiY5enWvwUlig1SZHEDShcsGaYfTd4_2-vho7-ARgi35OlvM38Bjj3Bu9D89aFfFL3UBD8Xval0Wb82MYXB9atD9A_kpVPU |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Implicit+Computational+Complexity+of+Subrecursive+Definitions+and+Applications+to+Cryptographic+Proofs&rft.jtitle=Journal+of+automated+reasoning&rft.au=Baillot%2C+Patrick&rft.au=Barthe%2C+Gilles&rft.au=Dal+Lago%2C+Ugo&rft.date=2019-12-01&rft.pub=Springer+Netherlands&rft.issn=0168-7433&rft.eissn=1573-0670&rft.volume=63&rft.issue=4&rft.spage=813&rft.epage=855&rft_id=info:doi/10.1007%2Fs10817-019-09530-2&rft.externalDocID=10_1007_s10817_019_09530_2 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-7433&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-7433&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-7433&client=summon |