{"id":"https://openalex.org/W4416866371","doi":"https://doi.org/10.1007/978-3-032-12287-2_11","title":"Privately Constrained PRFs from\u00a0DCR: Puncturing and\u00a0Bounded Waring Rank","display_name":"Privately Constrained PRFs from\u00a0DCR: Puncturing and\u00a0Bounded Waring Rank","publication_year":2025,"publication_date":"2025-12-01","ids":{"openalex":"https://openalex.org/W4416866371","doi":"https://doi.org/10.1007/978-3-032-12287-2_11"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-12287-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-12287-2_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105268443","display_name":"Amik Raj Behera","orcid":"https://orcid.org/0009-0007-7328-8809"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amik Raj Behera","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084208688","display_name":"Pierre Meyer","orcid":"https://orcid.org/0000-0003-2128-5204"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre Meyer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028570693","display_name":"Claudio Orlandi","orcid":"https://orcid.org/0000-0003-4992-0249"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claudio Orlandi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050543367","display_name":"Lawrence Roy","orcid":"https://orcid.org/0009-0003-8436-0029"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lawrence Roy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5018185386","display_name":"Peter Sch\u00f6ll","orcid":"https://orcid.org/0000-0002-7937-8422"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Scholl","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5105268443"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59373348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6995999813079834},{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.5076000094413757},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.46869999170303345},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4219000041484833},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.4052000045776367},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.39959999918937683},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3984000086784363},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.3813000023365021},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.37279999256134033},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.35109999775886536}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6995999813079834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5450000166893005},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.5076000094413757},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4514999985694885},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.4052000045776367},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.39959999918937683},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3984000086784363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39489999413490295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39340001344680786},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.37279999256134033},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C173259116","wikidata":"https://www.wikidata.org/wiki/Q864003","display_name":"Discrete logarithm","level":4,"score":0.3481000065803528},{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.3328000009059906},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.28299999237060547},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2761000096797943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2709999978542328},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C92717368","wikidata":"https://www.wikidata.org/wiki/Q1162538","display_name":"Plaintext","level":3,"score":0.25940001010894775},{"id":"https://openalex.org/C203062551","wikidata":"https://www.wikidata.org/wiki/Q201339","display_name":"Public-key cryptography","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-032-12287-2_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-032-12287-2_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/29778553-5a85-45de-b08b-ee5e5349dd5d","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/29778553-5a85-45de-b08b-ee5e5349dd5d","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Behera , A R , Meyer , P , Orlandi , C , Roy , L & Scholl , P 2026 , Privately Constrained PRFs from\u00a0DCR : Puncturing and\u00a0Bounded Waring Rank . in B Applebaum & H Lin (eds) , Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings . Springer , Lecture Notes in Computer Science , vol. 16268 LNCS , pp. 301-332 , 23rd International Conference on Theory of Cryptography, TCC 2025 , Aarhus , Denmark , 01/12/2025 . https://doi.org/10.1007/978-3-032-12287-2_11","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.atira.dk:publications/9d9fa9ad-c14f-4bda-a887-278345f0a22f","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/9d9fa9ad-c14f-4bda-a887-278345f0a22f","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Behera, A R, Meyer, P, Orlandi, C, Roy, L & Scholl, P 2026, Privately Constrained PRFs from\u00a0DCR : Puncturing and\u00a0Bounded Waring Rank. in B Applebaum & H Lin (eds), Theory of Cryptography - 23rd International Conference, TCC 2025, Proceedings. Springer, Lecture Notes in Computer Science, vol. 16268 LNCS, pp. 301-332, 23rd International Conference on Theory of Cryptography, TCC 2025, Aarhus, Denmark, 01/12/2025. https://doi.org/10.1007/978-3-032-12287-2_11","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W649038814","https://openalex.org/W1544327602","https://openalex.org/W1554247779","https://openalex.org/W1952573265","https://openalex.org/W1963071371","https://openalex.org/W1984153141","https://openalex.org/W1993060580","https://openalex.org/W2394717347","https://openalex.org/W2489433463","https://openalex.org/W2592974355","https://openalex.org/W2603265044","https://openalex.org/W2624867227","https://openalex.org/W2763778230","https://openalex.org/W2766553718","https://openalex.org/W2792973995","https://openalex.org/W2883127957","https://openalex.org/W2968502565","https://openalex.org/W2972047303","https://openalex.org/W3013595713","https://openalex.org/W3157351706","https://openalex.org/W3159942927","https://openalex.org/W4313124429","https://openalex.org/W4365807544","https://openalex.org/W4395960892","https://openalex.org/W4404903190","https://openalex.org/W4405208657","https://openalex.org/W4413458348"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-12-03T00:04:00.142953","created_date":"2025-12-01T00:00:00"}