A construction for general and efficient oblivious commitment based envelope protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4307 LNCS, Issue , 2006, Pages 122-138

  Li, Jiangtao ^a   Li, Ninghui ^b  

^a INTEL CORPORATION   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADDITIONAL COSTS; ATTRIBUTE BASED ACCESS CONTROL; BLACK BOXES; OBLIVIOUS COMMITMENT-BASED ENVELOPES; ZERO KNOWLEDGE PROOF;

ACCESS CONTROL;

EID: 84963698116     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935308_10     Document Type: Conference Paper

References (30)

1. WalidBagga and RefikMolva.Policy-based cryptography and applications.In Proceedings of the 9th International Conference on Financial Cryptography and Data Security, February2005.
2. DirkBalfanz, GlennDurfee, NarendarShankar, DianaSmetters, JessicaStaddon, and Hao-ChiWong. Secret handshakes from pairing-based key agreements.In Proceedings of the IEEE Symposium and Security and Privacy, pages180–196, May2003.
3. NikoBarić and BirgitPfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology: EUROCRYPT ’97, volume 1233 of LNCS, pages 480–494. Springer, 1997.
4. MihirBellare and OdedGoldreich.On defining proofs of knowledge. In Advances in Cryptology: CRYPTO ’92, volume 740 of LNCS, pages 390–420. Springer, 1992.
5. Mihir Bellare and Phillip Rogaway. Random oracles arepractical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62–73. ACM Press, 1993.
6. Fabrice Boudot. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology: EUROCRYPT ’00, volume 1807 of LNCS, pages 431–444, May2000.
7. RobertBradshaw, JasonHolt, and KentSeamons.Concealing complex policies with hidden credentials. In Proceedings of 11th ACM Conference on Computer and Communications Security, pages 146–157, October2004.
8. JanCamenisch and AnnaLysyanskaya.An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Advances in Cryptology: EUROCRYPT ’01, volume 2045 of LNCS, pages 93–118. Springer, 2001.
9. ClaudeCastelluccia, StanislawJarecki, and GeneTsudik.Secret handshakes from CA-oblivious encryption. In Advances in Cryptology: ASIACRYPT ’04, pages 293–307, December2004.
10. RonaldCramer and VictorShoup.Signature schemes based on the strong RSA assumption. In Proceedings of the 6th ACM Conference on Computer and Communications Security, pages 46–51. ACM Press, November1999.
11. JasonCrampton and GeorgeLoizou.Administrative scope and role hierarchy operations. In Proceedings of 7th ACM Symposium on Access Control Models and Technologies, pages 145–154, June2002.
12. Claude Crépeau. Verifiable disclosure of secrets and applications (abstract). In Advances in Cryptology: EUROCRYPT ’89, volume 434 of LNCS, pages 150–154. Springer, 1990.
13. Giovanni DiCrescenzo, RafailOstrovsky, and S.Rajagopalan.Conditional oblivious transfer and timed-release encryption. In Advances in Cryptology: EUROCRYPT ’99, volume 1592 of LNCS, pages 74–89, March1999.
14. IvanDamgård and EiichiroFujisaki.An integer commitment scheme based on groups with hidden order. In Advances in Cryptology: ASIACRYPT ’02, volume 2501 of LNCS, pages 125–142. Springer, December2002.
15. YevgeniyDodis, AggelosKiayias, AntonioNicolosi, and VictorShoup.Anonymous identification in ad hoc groups.In Advances in Cryptology: EUROCRYPT2004, pages 609–626, May2004.
16. Keith B. Frikken, Mikhail J. Atallah, and Jiangtao Li. Hidden access control policies with hidden credentials. In Proceedings of the 3rd ACM Workshop on Privacy in the ElectronicSociety, October 2004.
17. EiichiroFujisaki and TatsuakiOkamoto.Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology: CRYPTO ’97, volume 1294 of LNCS, pages 16–30. Springer, 1997.
18. JuanGaray, PhilipMacKenzie, and KeYang.Efficient and universally composable committed oblivious transfer and applications. In Theory of Cryptography, TCC 2004, volume 2951 of LNCS, pages 297–316. Springer, 2004.
19. JasonE. Holt, Robert W. Bradshaw, Kent E. Seamons, and HilarieOrman. Hidden credentials.InProceedings of the 2nd ACM Workshop on Privacy in the ElectronicSociety, pages 1–8, October 2003.
20. JiangtaoLi and Ninghui Li.OACerts: Oblivious attribute certificates. In Proceedings of the 3rd Conference on Applied Cryptography and Network Security, volume 3531 of LNCS, pages 301–317. Springer, June2005.
21. JiangtaoLi and NinghuiLi. Policy-hiding access control in open environment. In Proceedings of the 24nd ACM Symposium on Principles of Distributed Computing, pages 29–38. ACM Press, July2005.
22. JiangtaoLi, NinghuiLi, and William H.Winsborough. Automated trust negotiation using cryptographic credentials. In Proceedings of the 12th ACM Conference on Computer and Communications Security, pages 46–57. ACM Press, November2005.
23. NinghuiLi, WenliangDu, and DanBoneh. Oblivious signature-based envelope. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, pages 182–189. ACM Press, July2003.
24. AnnaLysyanskaya, Ronald L.Rivest, AmitSahai, and StefanWolf. Pseudonym systems. In Proceedings of the 6th Workshop on Selected Areas in Cryptography, volume 1758 of LNCS, pages 184–199. Springer, 1999.
25. TorbenP.Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology: CRYPTO ’91, volume 576 of LNCS, pages 129–140. Springer, 1991.
26. Michael O.Rabin. How to exchange secrets by oblivious transfer. Technical Report Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
27. Nigel Smart. Access control using pairing based cryptography. In Proceedings of the Cryptographers’ Track at the RSA Conference2003, pages111–121. Springer-Verlag LNCS2612, April2003.
28. William H.Winsborough and NinghuiLi.Safety in automated trust negotiation. In Proceedings of the IEEE Symposium on Security and Privacy, pages147–160, May2004.
29. William H.Winsborough, Kent E.Seamons, and Vicki E.Jones.Automated trust negotiation. In DARPA Information Survivability Conference and Exposition, volume I, pages 88–102. IEEE Press, January2000.
30. TingYu, MarianneWinslett, and Kent E.Seamons.Supporting structured credentials and sensitive policies through interoperable strategies for automated trust negotiation.ACM Transactions on Information and System Security, 6(1):1–42, February2003.