An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the priv
An exclusive encryption system is established using multiple computing devices. The exclusive encryption system allows for the exclusion of certain plaintext (e.g., by one of the computing devices) and ciphertext (e.g., by another of the computing devices) while at the same time maintaining the privacy created by the encryption (e.g., so the other computing device cannot see the plaintext). The exclusive encryption system may be implemented as part of a serverless distributed file system with directory entries (e.g., file names or folder names) being the plaintext, or alternatively as part of other systems.
대표청구항▼
The invention claimed is: 1. One or more computer-readable media having stored thereon a plurality of instructions that, when executed by one or more processors of a computer, causes the one or more processors to perform acts comprising: receiving an identifier; generating, based on the identifier,
The invention claimed is: 1. One or more computer-readable media having stored thereon a plurality of instructions that, when executed by one or more processors of a computer, causes the one or more processors to perform acts comprising: receiving an identifier; generating, based on the identifier, a mapped identifier; encoding the mapped identifier, wherein encoding the mapped identifier comprises: reversing an order of characters in the mapped identifier; removing, from a reversed mapped identifier, all trailing characters of a particular type; initializing the encoded identifier with a string of one bits equal in number to a number of trailing characters removed from the reversed mapped identifier followed by a zero bit; selecting a first character from the reversed mapped identifier; encoding the first character using a first coding table; adding, to the encoded identifier, a series of zero bits followed by the encoded first character; for each additional character in the reversed mapped identifier, selecting a next character in the reversed mapped identifier, encoding the next character using a second coding table, adding, to the encoded identifier, a series of zero bits followed by the encoded next character; and removing any trailing zero bits and the one bit preceding the trailing zero bits from the encoded identifier; and encrypting the encoded mapped identifier. 2. One or more computer-readable media as recited in claim 1, wherein the identifier comprises one of: a file name, a folder name, and a directory name. 3. One or more computer-readable media as recited in claim 1, the acts further comprising: generating, based on the mapped identifier, a decasified identifier and corresponding case information; wherein the encoding comprises encoding the decasified identifier; and wherein the encrypting comprises encrypting both the encoded decasified identifier and the case information. 4. One or more computer-readable media as recited in claim 1, wherein the generating comprises generating the mapped identifier only if the received identifier is syntactically legal. 5. One or more computer-readable media as recited in claim 1, wherein generating the mapped identifier comprises: checking whether the identifier is equal to one of a plurality of illegal identifiers; if the identifier is not equal to one of the plurality of illegal identifiers, then checking whether the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters; if the identifier is not equal to one of the plurality of illegal identifiers followed by one or more particular characters, then using the identifier as the mapped identifier; and if the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters, then using as the mapped identifier the identifier with one of the particular characters removed. 6. One or more computer-readable media as recited in claim 1, wherein each coding in the first coding table is the same as a corresponding coding in the second coding table, but the second coding table codes additional characters not coded by the first coding table. 7. One or more computer-readable media as recited in claim 1, wherein the encrypting comprises encrypting the encoded mapped identifier to generate, using a block cipher, a ciphertext having a fixed size. 8. A computer comprising: a processor; a computer storage media, coupled to the processor, to store instructions that, when executed by the processor, cause the processor to perform acts comprising: receiving an identifier; generating, based on the identifier, a mapped identifier; encoding the mapped identifier, wherein encoding the mapped identifier comprises: reversing an order of characters in the mapped identifier; removing, from a reversed mapped identifier, all trailing characters of a particular type; initializing the encoded identifier with a string of one bits equal in number to a number of trailing characters removed from the reversed mapped identifier followed by a zero bit; selecting a first character from the reversed mapped identifier; encoding the first character using a first coding table; adding, to the encoded identifier, a series of zero bits followed by the encoded first character; for each additional character in the reversed mapped identifier, selecting a next character in the reversed mapped identifier, encoding the next character using a second coding table, adding, to the encoded identifier, a series of zero bits followed by the encoded next character; and removing any trailing zero bits and the one bit preceding the trailing zero bits from the encoded identifier; and encrypting the encoded mapped identifier. 9. A computer as recited in claim 8, the acts further comprising: generating, based on the mapped identifier, a decasified identifier and corresponding case information; wherein the encoding comprises encoding the decasified identifier; and wherein the encrypting comprises encrypting both the encoded decasified identifier and the case information. 10. A computer as recited in claim 8, wherein the encoding comprises encoding the mapped identifier only if the received identifier is syntactically legal. 11. A computer as recited in claim 8, wherein generating the mapped identifier comprises: checking whether the identifier is equal to one of a plurality of illegal identifiers; if the identifier is not equal to one of the plurality of illegal identifiers, then checking whether the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters; if the identifier is not equal to one of the plurality of illegal identifiers followed by one or more particular characters, then using the identifier as the mapped identifier; and if the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters, then using as the mapped identifier the identifier with one of the particular characters removed. 12. A computer as recited in claim 8, wherein the characters of a particular type are the characters that are coded to zero using the first coding table. 13. A computer as recited in claim 8, wherein the first coding table and the second coding table are Huffman coding tables. 14. A computer as recited in claim 8, wherein encrypting the encoded mapped identifier comprises using a block cipher to encrypt the encoded identifier. 15. A system comprising: means for receiving an identifier; means for generating, based on the identifier, a mapped identifier; means for encoding the mapped identifier, wherein the means for encoding the mapped identifier comprises: means for reversing an order of characters in a reverse mapped identifier; means for removing, from the reversed mapped identifier, all trailing characters of a particular type; means for initializing the encoded identifier with a string of one bits equal in number to a number of trailing characters removed from the reversed mapped identifier followed by a zero bit; means for selecting a first character from the reversed mapped identifier; means for encoding the first character using a first coding table; a means for adding, to the encoded identifier, a series of zero bits followed by the encoded first character; means for, for each additional character in the reversed mapped identifier, selecting a next character in the reversed mapped identifier, encoding the next character using a second coding table, adding, to the encoded identifier, a series of zero bits followed by the encoded next character; and means for removing any trailing zero bits and the one bit preceding the trailing zero bits from the encoded identifier; and means for encrypting the encoded mapped identifier. 16. A system as recited in claim 15, further comprising: means for generating, based on the mapped identifier, a decasified identifier and corresponding case information; wherein the means for encoding comprises means for encoding the decasified identifier; and wherein the means for encrypting comprises means for encrypting both the encoded decasified identifier and the case information. 17. A system as recited in claim 16, wherein the means for generating the decasifled identifier and corresponding case information comprises: means for, for each character that has both an upper-case and a lower-case form, storing the character in upper-case form and recording in the case information whether the character was in upper-case form or lower-case form. 18. A system as recited in claim 15, wherein the means for generating the mapped identifier comprises: means for checking whether the identifier is equal to one of a plurality of illegal identifiers; means for, if the identifier is not equal to one of the plurality of illegal identifiers, checking whether the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters; means for, if the identifier is not equal to one of the plurality of illegal identifiers followed by one or more particular characters, using the identifier as the mapped identifier; and means for, if the identifier is equal to one of the plurality of illegal identifiers followed by one or more particular characters, using as the mapped identifier the identifier with one of the particular characters removed. 19. A system as recited in claim 15, wherein for the first character and each additional character, the means for encoding comprises means for encoding the character only if a set of leading bits of the character are zero, and further comprising means for adding the character to the encoded identifier if the set of leading bits of the character are not zero. 20. A system as recited in claim 15, wherein the means for encrypting the encoded mapped identifier comprises means for using cipher block chaining to encrypt the encoded identifier.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (100)
Schmidt, Rene W.; Muller, Hans E.; Violet, Scott R., Apparatus and method for incremental updating of archive files.
Hirayama Hideaki,JPX ; Shirakihara Toshio,JPX, Checkpointing computer system having duplicated files for executing process and method for managing the duplicated files.
Drummond Shattuck Reed ; Peter Earnshaw Heymann ; Steven Mark Mushero ; Kevin Benard Jones ; Jeffrey Todd Oberlander ; Dan Banay, Computer-based communication system and method using metadata defining a control-structure.
Govindarajan Rangaprasad ; Edwards Russ ; Bannister Cecil ; Gostanian ; Jr. Raffi, Data processing system and method for providing personal information in a communication network.
Arnold Kenneth C. R. C. ; Waldo James H. ; Riggs Roger ; Wollrath Ann M. ; Jones Peter, Database system employing polymorphic entry and entry matching.
Berbec Robert R. ; Brady John L. ; Caffrey James M. ; Crimi Joanne T. ; Fenaroli Arthur P. ; Iatridis Matthew C. ; Puchkoff Gary S. ; Sanchez Roberto J. ; Whalen Madeline R. ; Williams Joseph A., Dynamic server-managed access control for a distributed file system.
Terada Hiroaki,JPX ; Nishikawa Hiroaki,JPX ; Yoshida Shin-ichi,JPX ; Hine Shunji,JPX ; Nishikawa Youichiro,JPX ; Hara Shuji,JPX ; Shima Kenji,JPX ; Inaoka Yoshie,JPX ; Yamasaki Tetsuo,JPX, File management apparatus permitting access to portions of a file by specifying a data structure identifier and data ele.
Alam Salim ; Bhalerao Vinayak A. ; Wu Charles ; Hu George ; Ferrell John I., File object synchronization between a desktop computer and a mobile device.
Alger Jeffrey H. ; Bennett John G. ; Marshall David A. ; Shutt David R., Generating and compressing universally unique identifiers (UUIDs) using counter having high-order bit to low-order bit.
Steven R. Soltis ; Matthew T. O'Keefe ; Thomas M. Ruwart ; Gerald A. Houlder ; James A. Coomes ; Michael H. Miller ; Edward A. Soltis ; Raymond W. Gilson ; Kenneth W. Preslan, Global file system and data storage device locks.
East Jeffrey A. ; Lingelbach Albert L. ; Lindell Steven J. ; Graefe Goetz ; Zastera Craig G. ; Agarwal Sameet H., Linked data structure integrity verification system which verifies actual node information with expected node information stored in a table.
Douceur,John R.; Theimer,Marvin M.; Adya,Atul; Bolosky,William J., Locating potentially identical objects across multiple computers based on stochastic partitioning of workload.
Douceur,John R.; Theimer,Marvin M.; Adya,Atul; Bolosky,William J., Locating potentially identical objects across multiple computers based on stochastic partitioning of workload.
Sudama Ram (Concord MA) Magid David L. (Worcester MA) Ouellette Kenneth W. (Groton MA), Mechanism for locating without search discrete application resources known by common name only in a distributed network.
Coates, Joshua L.; Bozeman, Patrick E.; Patterson, David A., Method and apparatus for accessing remote storage in a distributed storage cluster architecture.
Cohen, Marc L.; Cooper, Michael R.; Nogay, Patrick Edward; Vanderwiele, Mark Wayne, Method and apparatus for compacting a metadatas stream in a data processing system.
Cooper Michael R. ; Hamzy Mark Joseph ; Nogay Patrick Edward ; Vanderwiele Mark Wayne, Method and apparatus for creating metadata streams with embedded device information.
O'Brien,Michael R.; Beckhardt,Steven R.; Lorenson,Elizabeth A.; Conmy,Douglas W., Method and apparatus for encrypting electronic messages composed using abbreviated address books.
Stevenson, David James; Gray, Andrew Hunter; Duncan, Robert James; Chisholm, Alastair Hugh; Serra, Vanessa; Tinto, Colin, Method and apparatus for fetching sparsely indexed MIB tables in managed network systems.
Logan Keith W. ; Misra Pradyumna K. ; Leach Paul J. ; Van Dyke Clifford P. ; Straube Dave D. ; Miller Arnold S., Method and apparatus for representing and applying network topological data.
Gramlich Wayne C. (Sunnyvale CA) Tirfing Soren J. (Palo Alto CA), Method and apparatus for the naming of database component files to avoid duplication of files.
Garay Juan Alberto ; Gennaro Rosario ; Jutla Charanjit Singh ; Rabin Tal D., Method and apparatus for the secure distributed storage and retrieval of information.
Cohen, Marc L.; Cooper, Michael R.; Nogay, Patrick Edward; Vanderwiele, Mark Wayne, Method and apparatus in a data processing system for generating metadata streams with per page data.
Sarit Mukherjee ; Ibrahim Kamel ; Prasant Mohapatra, Multimedia file systems using file managers located on clients for managing network attached storage devices.
Schmuck Frank B. ; Zlotek Anthony J. ; Shmueli Boaz,ILX ; Mandler Benjamin,ILX ; Yehudai Zvi Yosef,ILX ; Kish William A., Parallel file system with method using tokens for locking modes.
Falls Patrick T.,GBX ; Wightman Andy T.,GBX, Processes and apparatuses for generating file correspondency through replication and synchronization between target and.
Knudsen Helge (Oakville CAX) Chong Daniel T. (Woodbridge CAX) Yaffe John (Mississauga CAX) Taugher James E. (Mississauga CAX) Robertson Michael (Mississauga CAX) Plazak Zbigniew (Etobicoke CAX), Programmable computer with automatic translation between source and object code.
Jones, Michael B.; Draves, Jr., Richard P.; Rosu, Daniela; Rosu, Marcel-Catalin, Providing predictable scheduling of programs using a repeating precomputed schedule.
Matyas, Jr.,Stephen Michael; Peyravian,Mohammad; Roginsky,Allen Leonid; Zunic,Nevenko, Secure data storage and retrieval in a client-server environment.
Matyas, Jr., Stephen Michael; Peyravian, Mohammad; Roginsky, Allen Leonid; Zunic, Nevenko, Secure data storage and retrieval with key management and user authentication.
Carter John B. ; Davis Scott H. ; Dietterich Daniel J. ; Frank Steven J. ; Lee Hsin H., Shared client-side web caching using globally addressable memory.
William J. Bolosky ; John R. Douceur ; Scott M. Cutshall ; Richard F. Rashid ; Nathan P. Myhrvold ; David A. Goebel, Single instance store for file systems.
Tevis Gregory J. (Tucson AZ) Waldo Ellen J. (Tucson AZ), Storage management of a first file system using a second file system containing surrogate files and catalog management i.
Carter John B. ; Davis Scott H. ; Dietterich Daniel J. ; Frank Steven J. ; Phillips Robert S. ; Woods John ; Porter David ; Lee Hsin H., System and method for providing highly available data storage using globally addressable memory.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.