Filters








19 Hits in 7.9 sec

Deep Learning for Text Style Transfer: A Survey

Di Jin, Zhijing Jin, Zhiting Hu, Olga Vechtomova, Rada Mihalcea
2021 Computational Linguistics  
We also provide discussions on a variety of important topics regarding the future development of this task.  ...  We discuss the task formulation, existing datasets and subtasks, evaluation, as well as the rich methodologies in the presence of parallel and non-parallel data.  ...  In Computational Linguistics, Philadelphia, Proceedings of the International Conference on Pennsylvania, USA.  ... 
doi:10.1162/coli_a_00426 fatcat:v7vmb62ckfcu5k5mpu2pydnrxy

A new approach to DNS security (DNSSEC)

Giuseppe Ateniese, Stefan Mangard
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The Domain Name System (DNS) is a distributed database that allows convenient storing and retrieving of resource records.  ...  We introduce a new strategy to build chains of trust from root servers to authoritative servers. The techniques we employ are based on symmetric-key cryptography.  ...  The first author would like to thank Aniello Del Sorbo, Steve Kent, and Hilarie Orman for helpful discussions on DNS and DNSSEC. Many thanks to the anonymous referees for their insightful comments.  ... 
doi:10.1145/501993.501996 fatcat:qrf2323dq5buhbkgghqhvocm5u

Interoperable strategies in automated trust negotiation

Ting Yu, Marianne Winslett, Kent E. Seamons
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
We introduce the concept of a trust negotiation protocol, which defines the ordering of messages and the type of information messages will contain.  ...  To date, only a tiny fraction of the space of possible negotiation strategies has been explored, and no two of the strategies proposed so far will interoperate.  ...  We also thank Shanghua Teng and Jim Gray for their constructive discussions and suggestions.  ... 
doi:10.1145/502001.502004 fatcat:eyvuwwtrvzbrladdsslduoypym

Error-tolerant password recovery

Niklas Frykholm, Ari Juels
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The user is able to recover the correct key if she remembers a certain percentage of the passwords correctly.  ...  Many encryption systems require the user to memorize high entropy passwords or passphrases and reproduce them exactly. This is often a difficult task.  ...  ACKNOWLEDGMENTS The authors wish to extend their thanks to Madhu Sudan, Burt Kaliski, Håkan Andersson and the anonymous reviewers of this paper for their comments and suggestions.  ... 
doi:10.1145/501984.501985 fatcat:fnjaxndxr5ca3of23qwsidmhpq

Constraint solving for bounded-process cryptographic protocol analysis

Jonathan Millen, Vitaly Shmatikov
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. CCS'01, November 5-8, 2001 , Philadelphia, Pennsylvania, USA.  ...  Fiore and Abadi [6] and Boreale [3] present algorithms for computing symbolic traces of infinite-state cryptographic protocols.  ... 
doi:10.1145/502006.502007 fatcat:65qnw6cv2vabxco5xdsoymvw3m

A new approach to DNS security (DNSSEC)

Giuseppe Ateniese, Stefan Mangard
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The Domain Name System (DNS) is a distributed database that allows convenient storing and retrieving of resource records.  ...  We introduce a new strategy to build chains of trust from root servers to authoritative servers. The techniques we employ are based on symmetric-key cryptography.  ...  The first author would like to thank Aniello Del Sorbo, Steve Kent, and Hilarie Orman for helpful discussions on DNS and DNSSEC. Many thanks to the anonymous referees for their insightful comments.  ... 
doi:10.1145/501983.501996 dblp:conf/ccs/AtenieseM01 fatcat:z7sqpiixnnfgfeaebzye4cryoi

An efficient security verification method for programs with stack inspection

Naoya Nitta, Yoshiaki Takata, Hiroyuki Seki
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
First, the computational complexity of the problem is investigated.  ...  We show that the problem for this subclass is solvable in linear time in the size of a program.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. CCS'01, November 5-8, 2001 , Philadelphia, Pennsylvania, USA.  ... 
doi:10.1145/501983.501994 dblp:conf/ccs/NittaTS01 fatcat:eekhqqyjo5h5rksh5h2c2uhpqu

Events in security protocols

Federico Crazzolara, Glynn Winskel
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the inductive method.  ...  protocols; so the events and dependency of a wide range of protocols are determined once and for all.  ...  GW thanks Martín Abadi for a timely overview of approaches to security protocols while they were both visiting Microsoft Research, Cambridge.  ... 
doi:10.1145/501997.501998 fatcat:wzob52kzzzaxta6okl52jxh3au

Interoperable strategies in automated trust negotiation

Ting Yu, Marianne Winslett, Kent E. Seamons
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
We introduce the concept of a trust negotiation protocol, which defines the ordering of messages and the type of information messages will contain.  ...  To date, only a tiny fraction of the space of possible negotiation strategies has been explored, and no two of the strategies proposed so far will interoperate.  ...  We also thank Shanghua Teng and Jim Gray for their constructive discussions and suggestions.  ... 
doi:10.1145/501983.502004 dblp:conf/ccs/YuWS01 fatcat:vfd7cmhq5zfsldgtafwjxybaga

Error-tolerant password recovery

Niklas Frykholm, Ari Juels
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The user is able to recover the correct key if she remembers a certain percentage of the passwords correctly.  ...  Many encryption systems require the user to memorize high entropy passwords or passphrases and reproduce them exactly. This is often a difficult task.  ...  ACKNOWLEDGMENTS The authors wish to extend their thanks to Madhu Sudan, Burt Kaliski, Håkan Andersson and the anonymous reviewers of this paper for their comments and suggestions.  ... 
doi:10.1145/501983.501985 dblp:conf/ccs/FrykholmJ01 fatcat:xb2ze66hznbtjfzabgua7kptba

Constraint solving for bounded-process cryptographic protocol analysis

Jonathan Millen, Vitaly Shmatikov
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. CCS'01, November 5-8, 2001 , Philadelphia, Pennsylvania, USA.  ...  Fiore and Abadi [6] and Boreale [3] present algorithms for computing symbolic traces of infinite-state cryptographic protocols.  ... 
doi:10.1145/501983.502007 dblp:conf/ccs/MillenS01 fatcat:osujqb2zuzf3fm2jncr6s2cuzq

Events in security protocols

Federico Crazzolara, Glynn Winskel
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
The events of a security protocol and their causal dependency can play an important role in the analysis of security properties. This insight underlies both strand spaces and the inductive method.  ...  protocols; so the events and dependency of a wide range of protocols are determined once and for all.  ...  GW thanks Martín Abadi for a timely overview of approaches to security protocols while they were both visiting Microsoft Research, Cambridge.  ... 
doi:10.1145/501983.501998 dblp:conf/ccs/CrazzolaraW01 fatcat:7yopeqqoqna5tlkvbv3t3x77be

Outlier Detection, Spatial [chapter]

Yufeng Kou, Chang-Tien Lu
2017 Encyclopedia of GIS  
This evolution shields the user from unnecessary details on how the complex information is stored and how the queries are evaluated, thereby enlarging the capacity of expressiveness for any commercial  ...  Depending on the operators and comparators involved in a constraint, this can be divided into four types of numerical constraints (Jaffar and Maher 1994): linear equality constraints, polynomial equality  ...  Acknowledgements This work has been partially funded by the Ministry of Science and Technology of Spain (TIN2015-63502-C3-2-R) and the European Regional Development Fund (ERDF/FEDER).  ... 
doi:10.1007/978-3-319-17885-1_945 fatcat:p5vw3xpawfeh3jjib5qpqyjlo4

Tangler

Marc Waldman, David Mazières
2001 Proceedings of the 8th ACM conference on Computer and Communications Security - CCS '01  
Individual documents within a collection can be securely updated in such a way that future readers of the collection see and tampercheck the updates.  ...  We describe the design of a censorship-resistant system that employs a unique document storage mechanism. Newly published documents are dependent on the blocks of previously published documents.  ...  To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. CCS'01, November 5-8, 2001 , Philadelphia, Pennsylvania, USA.  ... 
doi:10.1145/501983.502002 dblp:conf/ccs/WaldmanM01 fatcat:in4tlkaqlbhuna75cunvgopq2a

Autonomic Response to Distributed Denial of Service Attacks [chapter]

Dan Sterne, Kelly Djahandari, Brett Wilson, Bill Babson, Dan Schnackenberg, Harley Holliday, Travis Reid
2001 Lecture Notes in Computer Science  
Acknowledgments The authors would like to acknowledge the valuable suggestions of the anonymous reviewers.  ...  Acknowledgements The authors would like to thank Jack Oden for distilling and Mary Ellen Leishear for editing the original report into this article.  ...  Proceedings of the 8th ACM Computer and Communications Security Conference held in Philadelphia, PA on November 5-8, 2001.  ... 
doi:10.1007/3-540-45474-8_9 fatcat:gzimnj7tqvd5zg2zl7pjxkhtzm
« Previous Showing results 1 — 15 out of 19 results