chapter

A shared view of sharing: the treaty of Orlando

Authors:

Lynn Andrea Stein,

Henry Lieberman,

David UngarAuthors Info & Claims

Object-oriented concepts, databases, and applications

January 1989

Pages 31 - 48

https://doi.org/10.1145/63320.66470

Published: 03 January 1989 Publication History

Abstract

No abstract available.

Cited By

View all

Herrmann S(2010)Demystifying object schizophreniaProceedings of the 4th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance10.1145/1929999.1930001(1-5)Online publication date: 22-Jun-2010
https://dl.acm.org/doi/10.1145/1929999.1930001
Cook WRyder BHailpern B(2007)AppleScriptProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238845(1-1-1-21)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238845
Ossher HRajan HMezini M(2007)A direction for research on virtual machine support for concern compositionProceedings of the 1st workshop on Virtual machines and intermediate languages for emerging modularization mechanisms10.1145/1230136.1230141(5-es)Online publication date: 12-Mar-2007
https://dl.acm.org/doi/10.1145/1230136.1230141
Show More Cited By

Index Terms

A shared view of sharing: the treaty of Orlando
1. Software and its engineering
  1. Software creation and management
    1. Designing software
      1. Software implementation planning
        Software design techniques
    2. Software development process management
  2. Software notations and tools
    1. General programming languages
      1. Language types

Recommendations

A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets

Verifiable secret sharing VSS has been extensively used as a cryptographic tool in many applications of information security in recent years. A VSS enables a dealer to divide a secret s into n shares and allows shareholders to verify whether their shares ...
Strong (n,t,n) verifiable secret sharing scheme

A (t,n) secret sharing divides a secret into n shares in such a way that any t or more than t shares can reconstruct the secret; but fewer than t shares cannot reconstruct the secret. In this paper, we extend the idea of a (t,n) secret sharing scheme ...
Sharing one secret vs. sharing many secrets

A secret sharing scheme is a method for distributing a secret among several parties in such a way that only qualified subsets of the parties can reconstruct it and unqualified subsets receive no information about the secret. A multi-secret sharing ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Object-oriented concepts, databases, and applications

January 1989

574 pages

ISBN:0201144107

DOI:10.1145/63320

Editors:
Won Kim
Microelectronics and Computer Technology Corp., Austin, TX
,
F. H. Lochovsky
Univ. of Toronto, Toronto, Canada

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1989

Permissions

Request permissions for this article.

Request Permissions

Qualifiers

Chapter

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Herrmann S(2010)Demystifying object schizophreniaProceedings of the 4th Workshop on MechAnisms for SPEcialization, Generalization and inHerItance10.1145/1929999.1930001(1-5)Online publication date: 22-Jun-2010
https://dl.acm.org/doi/10.1145/1929999.1930001
Cook WRyder BHailpern B(2007)AppleScriptProceedings of the third ACM SIGPLAN conference on History of programming languages10.1145/1238844.1238845(1-1-1-21)Online publication date: 9-Jun-2007
https://dl.acm.org/doi/10.1145/1238844.1238845
Ossher HRajan HMezini M(2007)A direction for research on virtual machine support for concern compositionProceedings of the 1st workshop on Virtual machines and intermediate languages for emerging modularization mechanisms10.1145/1230136.1230141(5-es)Online publication date: 12-Mar-2007
https://dl.acm.org/doi/10.1145/1230136.1230141
Kumar PTarr PCook W(2006)Modal logic & ownership typesCompanion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications10.1145/1176617.1176721(778-779)Online publication date: 22-Oct-2006
https://dl.acm.org/doi/10.1145/1176617.1176721
Yu S(2001)Class-is-type is inadequate for object reuseACM SIGPLAN Notices10.1145/504359.50436436:6(50-59)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.1145/504359.504364
Dourish PEdwards WHowell JLaMarca ALamping JPetersen KSalisbury MTerry DThornton JAckerman MEdwards K(2000)A programming model for active documentsProceedings of the 13th annual ACM symposium on User interface software and technology10.1145/354401.354410(41-50)Online publication date: 1-Nov-2000
https://dl.acm.org/doi/10.1145/354401.354410
Balaguer JBauer CDiehl SBalaguer J(1999)Less is moreProceedings of the fourth symposium on Virtual reality modeling language10.1145/299246.299260(39-45)Online publication date: 23-Feb-1999
https://dl.acm.org/doi/10.1145/299246.299260
Cerri SLoia V(1997)A Concurrent, Distributed Architecture for Diagnostic ReasoningUser Modeling and User-Adapted Interaction10.1023/A:10082639150437:2(69-105)Online publication date: 1-Feb-1997
https://dl.acm.org/doi/10.1023/A%3A1008263915043
Bardou DDony C(1996)Split objectsACM SIGPLAN Notices10.1145/236338.23634731:10(122-137)Online publication date: 1-Oct-1996
https://dl.acm.org/doi/10.1145/236338.236347
Bardou DDony CAnderson LCoplien J(1996)Split objectsProceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/236337.236347(122-137)Online publication date: 1-Oct-1996
https://dl.acm.org/doi/10.1145/236337.236347
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets

Strong (n,t,n) verifiable secret sharing scheme

Sharing one secret vs. sharing many secrets

Comments

Information

Published In

Publisher

Publication History

Permissions

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations